Estimating the efficiency of backtrack programs.

@article{Knuth1974EstimatingTE,
  title={Estimating the efficiency of backtrack programs.},
  author={D. Knuth},
  journal={Mathematics of Computation},
  year={1974},
  volume={29},
  pages={122-136}
}
  • D. Knuth
  • Published 1974
  • Mathematics
  • Mathematics of Computation
One of the chief difficulties associated with the so-called backtracking technique for combinatorial problems has been our inability to predict the efficiency of a given algorithm, or to compare the efficiencies of different approaches, without actually writing and running the programs. This paper presents a simple method which produces reasonable estimates for most applications, requiring only a modest amount of hand calculation. The method should prove to be of considerable utility in… Expand

Figures and Tables from this paper

Early Estimates of the Size of Branch-and-Bound Trees
TLDR
The time needed to solve mixed-integer-programming problems by branch and bound can be roughly predicted early in the solution process, based on analyzing the partial tree resulting from running the algorithm for a short period of time and predicting the shape of the whole tree. Expand
Backtrack programming techniques
TLDR
It is shown how the use of macros can considerably shorten the computation time in many cases and the general backtrack 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 combinatorsial problem. Expand
Control Structure Abstractions of the Backtracking Programming Technique
TLDR
Control structure abstraction in the context of correctness is that proofs of general properties of a class of programs with similar control structures are separated from proofs of specific properties of individual programs of the class. Expand
A procedure mechanism for backtrack programming
TLDR
A procedure mechanism that uses coroutines as a means for the description and realization of nondeterministic algorithms and a solution to the eight queens problem is given to illustrate the application of the procedure mechanism to backtracking problems. Expand
A sufficient condition for backtrack-bounded search
TLDR
A relationship involving the structure of the constraints is described that provides a bound on the backtracking required to advance deeper into the backtrack tree, which leads to upper bounds on the effort required for solution of a class of constraint satisfaction problems. Expand
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
TLDR
Analytically and experimentally show that a lookahead procedure called forward checking which employs the most likely to fail principle performs better than standard backtracking, Ullman's, Waltz's, Mackworth's, and Haralick's discrete relaxation in all cases tested, and better than Gaschnig's backmarking in the larger problems. Expand
Predicting the Size of Depth-First Branch and Bound Search Trees
TLDR
These methods extend to DFBnB the approaches provided by Knuth-Chen schemes that were designed and applied for predicting the EST size of backtracking search algorithms, and demonstrate good predictions which are superior to competing schemes. Expand
On the Analysis of Backtrack Procedures for the Colouring of Random Graphs
Backtrack search algorithms are procedures capable of deciding whether a decision problem has a solution or not through a sequence of trials and errors. Analysis of the performances of theseExpand
Backtrack-free and backtrack-bounded search
TLDR
Conditions are identified under which bounds can be placed on the amount of backtracking required to solve constraint satisfaction search problems, and problem complexity is shown to have a bound exponential in the size of the largest biconnected component of the problem’s constraint graph. Expand
An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms
TLDR
This work compares three algorithms which predict how many nodes of a search tree are visited and shows that incorrect predictions not only occur because of large statistical variations but also because of (perceived) systemic biases of the prediction. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
Backtrack Programming
TLDR
A widely used method of efftcient search is examined in detail and its scope and methods are formulated in their full generality. Expand
Branch-and-Bound Methods: A Survey
TLDR
The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed, including integer linear programming Land-Doig and Balas methods, nonlinear programming minimization of nonconvex objective functions, and the quadratic assignment problem Gilmore and Lawler methods. Expand
Self‐Avoiding Random Walks. I. Simple Properties of Intermediate‐Length Walks
A new method is presented for the rapid detection of self‐intersections in random walks generated by Monte Carlo processes. Reduction in required computer time made possible by this method allows theExpand
Caissa's Wild Roses, C
  • M. Fox, Surrey, England, 1935; reprinted in Five Classics of Fairy Chess, Dover, New York,
  • 1973
Fundamental Algorithms, The Art of Computer Programming, vol
  • 1, second edition Addison-Wesley, Reading, Mass.,
  • 1973
Elements of Combinatorial Computing
The 23 Colored Cubes
The 23 colored cubes," Math
  • Mag., v. 44,
  • 1971
Uncrossed knight's tours
  • J. Recreational Math
  • 1969
Uncrossed knight's tours," (letter to the editor)
  • J. Recreational Math
  • 1969
...
1
2
3
4
5
...