Backtrack programming techniques
From MaRDI portal
Publication:4072832
DOI10.1145/361219.361224zbMath0313.68026OpenAlexW2024182184WikidataQ127705680 ScholiaQ127705680MaRDI QIDQ4072832
Edward M. Reingold, James R. Bitner
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361219.361224
Related Items
Model-based inference in CHARME., Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity, An average case analysis of a resolution principle algorithm in mechanical theorem proving., Interactive scheduling as a constraint satisfiability problem, Exhaustive approaches to 2D rectangular perfect packings, Branch \& Sample: A simple strategy for constraint satisfaction, Optimal rectangle packing, Backtracking with multi-level dynamic search rearrangement, A theoretical evaluation of selected backtracking algorithms., A non-binary constraint ordering heuristic for constraint satisfaction problems, Automatic design of quantum circuits. Generation of quantum teleportation protocols, Information-theoretic approaches to branching in search, An almost perfect heuristic for the N nonattacking queens problem, The \(Multi\)-SAT algorithm, New decision rules for exact search in \(N\)-queens, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Staffing a software project: A constraint satisfaction and optimization-based approach, Multi-agent oriented constraint satisfaction, Parallel state-space search for a first solution with consistent linear speedups, Efficient graph automorphism by vertex partitioning, Average time analyses of simplified Davis-Putnam procedures, A backtracking method for constructing perfect hash functions from a set of mapping functions, Backtracking tactics in the backtrack method for SAT, Backjump-based backtracking for constraint satisfaction problems, Dynamic variable ordering in graph based backjumping algorithms for csps
