A theoretical evaluation of selected backtracking algorithms.
From MaRDI portal
Recommendations
Cites work
- A theoretical evaluation of selected backtracking algorithms.
- Backtrack programming techniques
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- Networks of constraints: Fundamental properties and applications to picture processing
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
Cited in
(42)- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
- A theoretical evaluation of selected backtracking algorithms.
- Backtracking algorithms for disjunctions of temporal constraints
- Search algorithms in type theory
- Decomposable constraints
- Backtracking tactics in the backtrack method for SAT
- Backjump-based backtracking for constraint satisfaction problems
- Binary vs. non-binary constraints
- On point-duration networks for temporal reasoning
- A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints
- On the relations between SAT and CSP enumerative algorithms
- On forward checking for non-binary constraint satisfaction.
- Amortized random backtracking
- The fixed point property for ordered sets
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
- Concurrent search for distributed CSPs
- Constraint satisfaction methods for solving the staff transfer problem
- The automorphism conjecture for small sets and series parallel sets
- Conflict-directed backjumping revisited
- scientific article; zbMATH DE number 4162307 (Why is no real title available?)
- Multiway spatial joins
- A hybrid graph representation for recursive backtracking algorithms
- scientific article; zbMATH DE number 3974342 (Why is no real title available?)
- scientific article; zbMATH DE number 67459 (Why is no real title available?)
- An enhancement scheme for constraint satisfaction problems (CSPs)
- scientific article; zbMATH DE number 2065281 (Why is no real title available?)
- scientific article; zbMATH DE number 2080297 (Why is no real title available?)
- scientific article; zbMATH DE number 2080311 (Why is no real title available?)
- scientific article; zbMATH DE number 1497830 (Why is no real title available?)
- Dynamic variable ordering in graph based backjumping algorithms for csps
- A survey of constraint-based programming paradigms
- Some new tractable classes of CSPs and their relations with backtracking algorithms
- Backjumping is Exception Handling
- A Theory for Backtrack-Downweighted Walks
- A semantic approach for web reasoning
- An analysis of backtrack-free algorithms on a constraint satisfaction problem with growing domains
- Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard
- Hybrid search for minimal perturbation in dynamic CSPs
- Making assumptions in the automated derivation
- Backjumping for quantified Boolean logic satisfiability
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- Asynchronous forward-checking for DisCSPs
This page was built for publication: A theoretical evaluation of selected backtracking algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399134)
