Skip to main content
SpringerLink
Log in
Book cover

Analysis and Design of Algorithms in Combinatorial Optimization pp 65–83Cite as

A Recursive Approach to the Implementation of Enumerative Methods

  • Chapter

  • 250 Accesses

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 266))

Abstract

Algorithms for generating permutations by means of both lexicographic and minimum-change methods are presented. A recursive approach to their implementation leads to transparent procedures that are easily proved correct; moreover, they turn out to be no less efficient than previous iterative generators. Some applications of explicit enumeration to combinatorial optimization problems, exploiting the minimum-change property, are indicated. Finally, a recursive approach to implicit enumeration is discussed.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • N. AGIN (1966) Optimum seeking with branch-and-bound. Management Sci. 13, B176–185.

    Google Scholar 

  • E. GALAS (1968) A note on the branch-and-bound principle. Operations Res. 16, 442–445, 886.

    Google Scholar 

  • W. BARTH (1968) Ein ALGOL 60 Programm zur Lósung des traveling Salesman Problems. Ablauf-and Planungsforschung 9, 99–105.

    Google Scholar 

  • J.R. BITNER, G. EHRLICH, E.M. REINGOLD (1976) Efficient generation of the binary reflected Gray code and its applications. Comm. ACM 19,517–521. N.

    Google Scholar 

  • DERSHOWITZ (1975) A simplified loop-free algorithm for generating permutations. BIT 15, 158–164.

    Article  MATH  MathSciNet  Google Scholar 

  • G. EHRLICH (1973A) Loopless algorithms for generating permutations, combinations and other combinatorial configurations. J. Assoc. Comput. Mach. 20, 500–513.

    Google Scholar 

  • G. EHRLICH (1973B) Algorithm 466, Four combinatorial algorithms. Comm: ACM 16, 690–691.

    Google Scholar 

  • S. EVEN (1973) Algorithmic Combinatorics, Macmillan, London.

    MATH  Google Scholar 

  • M. GARDNER (1974) Some new and dramatic demonstrations of number theorems with playing cards. Sci. Amer. 231, 122–125.

    Article  ADS  Google Scholar 

  • D. GRIES (1975) Recursion as a programming tool. Technical Report 234, Department of Computer Science, Cornell University, Ithaca.

    Google Scholar 

  • K. HARADA (1971) Generation of rosary permutations expressed in Hamiltonian circuits. Comm. ACM 14, 373–379.

    Article  MATH  MathSciNet  Google Scholar 

  • S.M. JOHNSON (1963) Generation of permutations by adjacent transposition. Math. Comp. 17, 282–285.

    Article  MATH  MathSciNet  Google Scholar 

  • R.M. KARP (1976) The probabilistic analysis of some combinatorial search algorithms. In: J.F. TRAUB (ed.) (1976) Algorithms and Complexity: New Directions and Recent Results, Academic Press, New York, 1–19.

    Google Scholar 

  • W.H. KOHLER, K. STEIGLITZ (1974) Characterization and theoretical properties of branch-and-bound algorithms for permutation problems. J. Assoc. Comput. Mach. 21, 140–156.

    MATH  MathSciNet  Google Scholar 

  • E.L. LAWLER, D.E. WOOD.(1966) Branch-and-bound methods: a survey. Operations Res. 14, 699–719.

    Google Scholar 

  • D.H. LEHMER (1964) The machine tool of combinatorics. In: E.F. BECKENBACH (ed.) (1964) Applied Combinatorial Mathematics, Wiley, New York, 5–31.

    Google Scholar 

  • H.W. LENSTRA, JR. (1973) Private communications.

    Google Scholar 

  • J.K. LENSTRA (1977) Sequencing by Enumerative Methods, Mathematical Centre Tracts 69, Mathematisch Centrum, Amsterdam.

    Google Scholar 

  • J.K. LENSTRA, A.H.G. RINNOOY KAN (1975) A recursive approach to the generation of combinatorial configurations. Report BW50, Mathematisch Centrum, Amsterdam.

    Google Scholar 

  • J.K. LENSTRA, A.H.G. RINNOOY KAN (1978) On the expected performance of branch-and-bound algorithms. Operations Res. 26, 347–349.

    Article  MATH  Google Scholar 

  • L.G. MITTEN (1970) Branch-and-bound methods: general formulation and properties. Operations Res. 18, 24–34.

    Article  MATH  MathSciNet  Google Scholar 

  • R.J. ORD-SMITH (1970) Generation of permutation sequences: part 1. Comput. J. 13, 152–155.

    Article  Google Scholar 

  • R.J. ORD-SMITH (1971) Generation of permutation sequences: part 2. Comput. J. 14, 136–139.

    Article  Google Scholar 

  • R.C. READ (1972) A note on the generation of rosary permutations. Comm. ACM 15, 775.

    Article  MathSciNet  Google Scholar 

  • E.M. REINGOLD, J. NIEVERGELT, N. DEO (1977) Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • A.H.G. RINNOOY KAN (1976) On Mitten’s axioms for branch-and-bound. Operations Res. 24, 1176–1178.

    Article  MathSciNet  Google Scholar 

  • A.H.G. RINNOOY KAN, B.J. LAGEWEG, J.K. LENSTRA (1975) Minimizing total costs in one-machine scheduling. Operations Res. 23, 908–927.

    Article  MATH  MathSciNet  Google Scholar 

  • M.K. ROY (1973) Reflection-free permutations, rosary permutations, and adjacent transposition algorithms. Comm. ACM 16, 312–313.

    Article  MATH  Google Scholar 

  • R. SEDGEWICK (1977) Permutation generation methods. Comput. Surveys 9, 137–164, 314.

    MathSciNet  Google Scholar 

  • C. TOMPKINS (1956) Machine attacks on problems whose variables are permutations. Proc. Sympos. App1. Math. 6, Amer. Math. Soc., Providence, 195–211.

    Google Scholar 

  • H.F. TROTTER (1962) Algorithm 115, Perm. Comm. ACM 5, 434–435.

    Article  Google Scholar 

  • M.B. WELLS (1971) Elements of Combinatorial Computing, Pergamon, Oxford.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisch Centrum, Amsterdam, Netherlands

    J. K. Lenstra

  2. Erasmus University, Rotterdam, Netherlands

    A. H. G. Rinnooy Kan

Authors
  1. J. K. Lenstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. H. G. Rinnooy Kan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IASI-CNR, Istituto di Automatica, Università di Roma, Italy

    G. Ausiello  & M. Lucertini  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Wien

About this chapter

Cite this chapter

Lenstra, J.K., Kan, A.H.G.R. (1981). A Recursive Approach to the Implementation of Enumerative Methods. In: Ausiello, G., Lucertini, M. (eds) Analysis and Design of Algorithms in Combinatorial Optimization. International Centre for Mechanical Sciences, vol 266. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2748-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2748-3_3

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81626-4

  • Online ISBN: 978-3-7091-2748-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation