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.
CITATION STYLE
Lenstra, J. K., & Kan, A. H. G. R. (1981). A Recursive Approach to the Implementation of Enumerative Methods. In Analysis and Design of Algorithms in Combinatorial Optimization (pp. 65–83). Springer Vienna. https://doi.org/10.1007/978-3-7091-2748-3_3
Mendeley helps you to discover research relevant for your work.