Backtrack Programming
From MaRDI portal
Publication:5514130
DOI10.1145/321296.321300zbMath0139.12305OpenAlexW2295268496MaRDI QIDQ5514130
Solomon W. Golomb, L. D. Baumert
Publication date: 1965
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321296.321300
Related Items
Partition search for non-binary constraint satisfaction, ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Unnamed Item, A fast backtrack algorithm for graph isomorphism, A note on extending Knuth's tree estimator to directed acyclic graphs, Optimal 2-coverage of a polygonal region in a sensor network, Pruning the search tree in the constructive enumeration of molecular graphs, Tree-search algorithms for quadratic assignment problems, An empirical study of phase transitions in binary constraint satisfaction problems, A structured program to generate all topological sorting arrangements, An integer linear programming approach to solving the Eternity puzzle, On the observable restrictions of limited consideration models: theory and application, Weak Schur numbers and the search for G. W. Walker's lost partitions, Dominance rules in combinatorial optimization problems, On the number of transitive digraphs with n labeled vertices and k arcs, An effective structured approach to finding optimal partitions of networks, A logic language for combinatorial optimization, Connecting Red Cells in a Bicolour Voronoi Diagram, A constraint propagation approach to structural model based image segmentation and recognition, Semantic-based regularization for learning and inference, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Linear congruence equations for the solutions of the \(N\)-queens problem, Staffing a software project: A constraint satisfaction and optimization-based approach, Global optimization numerical strategies for rate-independent processes, Hadamard Matrices of Order 32, Construction of vector lists and isomorph rejection, 2-Covered paths by a set of antennas with minimum power transmission range, On the classification of Hadamard matrices of order 32, Backtracking in recursive computations, Using matrices to link conflict evolution and resolution in a graph model, Unnamed Item, Classification of simple 2-(11,3,3) designs, Preventing redundant solutions in partial enumeration algorithms, Constraint Satisfaction, Unnamed Item, Theoretical comparisons of search strategies in branch-and-bound algorithms, REF-ARF: A system for solving problems stated as procedures, Backtrack search with isomorph rejection and consistency check, Schur numbers involving rainbow colorings, The combinatorial analysis of patterns and the principle of inclusion- exclusion, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, Backtracking algorithms for disjunctions of temporal constraints, Avoiding squares and overlaps over the natural numbers, A survey of bounds for classical Ramsey numbers, On Some Open Questions for Ramsey and Folkman Numbers, On forward checking for non-binary constraint satisfaction., A backtracking method for constructing perfect hash functions from a set of mapping functions, On generalized Steiner systems and semi-biplanes, A new mathematical model for tiling finite regions of the plane with polyominoes, Backjump-based backtracking for constraint satisfaction problems
