Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Dmitry V. Kruchinin & Yuriy V. Shablya, 2015. "Explicit Formulas for Meixner Polynomials," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2015, pages 1-5, October.
- Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
- Cosmin Sabo & Petrică C. Pop & Andrei Horvat-Marc, 2020. "On the Selective Vehicle Routing Problem," Mathematics, MDPI, vol. 8(5), pages 1-11, May.
- Dmitry Kruchinin & Vladimir Kruchinin & Yuriy Shablya, 2021. "Method for Obtaining Coefficients of Powers of Bivariate Generating Functions," Mathematics, MDPI, vol. 9(4), pages 1-17, February.
- Gerson N. Cardoso & Geraldo E. Silva, 2024. "Electoral influences on the Brazilian B3 data correlation network," International Journal of Finance & Economics, John Wiley & Sons, Ltd., vol. 29(1), pages 251-272, January.
- José-Manuel Giménez-Gómez & Josep E Peris & Begoña Subiza, 2020.
"An egalitarian approach for sharing the cost of a spanning tree,"
PLOS ONE, Public Library of Science, vol. 15(7), pages 1-14, July.
- Giménez Gómez, José M. (José Manuel) & Peris, Josep E. & Subiza, Begoña, 2019. "An egalitarian approach for sharing the cost of a spanning tree," Working Papers 2072/376029, Universitat Rovira i Virgili, Department of Economics.
- Giménez-Gómez, José M & Peris, Josep E & Subiza, Begoña, 2019. "An Egalitarian Approach for Sharing the Cost of a Spanning Tree," QM&ET Working Papers 19-3, University of Alicante, D. Quantitative Methods and Economic Theory.
- Ana Klobučar & Robert Manger, 2020. "Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees," Mathematics, MDPI, vol. 8(2), pages 1-16, February.
- Jann Michael Weinand & Kenneth Sorensen & Pablo San Segundo & Max Kleinebrahm & Russell McKenna, 2020. "Research trends in combinatorial optimisation," Papers 2012.01294, arXiv.org.
More about this item
Keywords
combinatorial generation; method; algorithm; AND/OR tree; Euler–Catalan’s triangle; labeled Dyck path; ranking algorithm; unranking algorithm;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:6:p:962-:d:370480. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.