Backtrack programming techniques
From MaRDI portal
Cited in
(27)- A backtracking method for constructing perfect hash functions from a set of mapping functions
- Branch \& Sample: A simple strategy for constraint satisfaction
- Backtracking with multi-level dynamic search rearrangement
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Model-based inference in CHARME.
- An average case analysis of a resolution principle algorithm in mechanical theorem proving.
- Interactive scheduling as a constraint satisfiability problem
- A theoretical evaluation of selected backtracking algorithms.
- Backtracking tactics in the backtrack method for SAT
- Backjump-based backtracking for constraint satisfaction problems
- Efficient graph automorphism by vertex partitioning
- The Multi-SAT algorithm
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- Exhaustive approaches to 2D rectangular perfect packings
- A non-binary constraint ordering heuristic for constraint satisfaction problems
- 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
- Dynamic variable ordering in graph based backjumping algorithms for csps
- Multi-agent oriented constraint satisfaction
- Optimal rectangle packing
- New decision rules for exact search in \(N\)-queens
- No tiling of the 70 70 square with consecutive squares
- NACRE -- a nogood and clause reasoning engine
- Parallel state-space search for a first solution with consistent linear speedups
- Average time analyses of simplified Davis-Putnam procedures
- 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)
