Backtrack programming techniques
From MaRDI portal
Publication:4072832
DOI10.1145/361219.361224zbMATH Open0313.68026OpenAlexW2024182184WikidataQ127705680 ScholiaQ127705680MaRDI QIDQ4072832FDOQ4072832
Authors: 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
Cited In (25)
- Backtracking tactics in the backtrack method for SAT
- Exhaustive approaches to 2D rectangular perfect packings
- Staffing a software project: A constraint satisfaction and optimization-based approach
- Automatic design of quantum circuits. Generation of quantum teleportation protocols
- Information-theoretic approaches to branching in search
- Branch \& Sample: A simple strategy for constraint satisfaction
- A non-binary constraint ordering heuristic for constraint satisfaction problems
- Backtracking with multi-level dynamic search rearrangement
- Dynamic variable ordering in graph based backjumping algorithms for csps
- Parallel state-space search for a first solution with consistent linear speedups
- The \(Multi\)-SAT algorithm
- Multi-agent oriented constraint satisfaction
- A theoretical evaluation of selected backtracking algorithms.
- Efficient graph automorphism by vertex partitioning
- Model-based inference in CHARME.
- Optimal rectangle packing
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- Average time analyses of simplified Davis-Putnam procedures
- A backtracking method for constructing perfect hash functions from a set of mapping functions
- An average case analysis of a resolution principle algorithm in mechanical theorem proving.
- New decision rules for exact search in \(N\)-queens
- Interactive scheduling as a constraint satisfiability problem
- Backjump-based backtracking for constraint satisfaction problems
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- An almost perfect heuristic for the N nonattacking queens problem
This page was built for publication: Backtrack programming techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4072832)