IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i6p962-d370480.html
   My bibliography  Save this article

Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application

Author

Listed:
  • Yuriy Shablya

    (Department of Complex Information Security of Computer Systems, Tomsk State University of Control Systems and Radioelectronics, Tomsk 634050, Russia)

  • Dmitry Kruchinin

    (Department of Complex Information Security of Computer Systems, Tomsk State University of Control Systems and Radioelectronics, Tomsk 634050, Russia)

  • Vladimir Kruchinin

    (Institute of Innovation, Tomsk State University of Control Systems and Radioelectronics, Tomsk 634050, Russia)

Abstract

In this paper, we study the problem of developing new combinatorial generation algorithms. The main purpose of our research is to derive and improve general methods for developing combinatorial generation algorithms. We present basic general methods for solving this task and consider one of these methods, which is based on AND/OR trees. This method is extended by using the mathematical apparatus of the theory of generating functions since it is one of the basic approaches in combinatorics (we propose to use the method of compositae for obtaining explicit expression of the coefficients of generating functions). As a result, we also apply this method and develop new ranking and unranking algorithms for the following combinatorial sets: permutations, permutations with ascents, combinations, Dyck paths with return steps, labeled Dyck paths with ascents on return steps. For each of them, we construct an AND/OR tree structure, find a bijection between the elements of the combinatorial set and the set of variants of the AND/OR tree, and develop algorithms for ranking and unranking the variants of the AND/OR tree.

Suggested Citation

  • Yuriy Shablya & Dmitry Kruchinin & Vladimir Kruchinin, 2020. "Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application," Mathematics, MDPI, vol. 8(6), pages 1-21, June.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:6:p:962-:d:370480
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/6/962/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/6/962/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Cosmin Sabo & Petrică C. Pop & Andrei Horvat-Marc, 2020. "On the Selective Vehicle Routing Problem," Mathematics, MDPI, vol. 8(5), pages 1-11, May.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Jann Michael Weinand & Kenneth Sorensen & Pablo San Segundo & Max Kleinebrahm & Russell McKenna, 2020. "Research trends in combinatorial optimisation," Papers 2012.01294, arXiv.org.

    Corrections

    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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.