Backtrack programming techniques
James R. Bitner, Edward M. Reingold · Communications of the ACM · 1975
The purpose of this paper is twofold. First, a brief exposition of the general backtrack technique and its history is given. Second, it is shown how the use of macros can considerably shorten the computation time in many cases. In particular, this technique has allowed the solution of two previously open combinatorial problems, the computation of new terms in a well-known series, and the substantial reduction in computation time for the solution to another combinatorial problem.
Cited by 326 works. doi:10.1145/361219.361224 Open-access PDF
Authors
References
- The Art of Computer Programming
- Depth-First Search and Linear Graph Algorithms
- The Art of Computer Programming. Volume 1: Fundamental Algorithms.
- Branch-and-Bound Methods: A Survey
- Backtrack Programming
- Selected combinatorial research problems.
- Estimating the efficiency of backtrack programs
- Mathematical Recreations and Essays
- Artificial intelligence : the heuristic programming approach
- Estimating the Efficiency of Backtrack Programs