Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
From MaRDI portal
Cites work
- A Sufficient Condition for Backtrack-Free Search
- Backtracking with multi-level dynamic search rearrangement
- Consistency in networks of relations
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 67481 (Why is no real title available?)
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- Synthesizing constraint expressions
- Tree clustering for constraint networks
Cited in
(12)- An optimal backtrack algorithm for tree-structured constraint satisfaction problems
- Backtracking algorithms for disjunctions of temporal constraints
- Backjump-based backtracking for constraint satisfaction problems
- Compiling constraint satisfaction problems
- On point-duration networks for temporal reasoning
- Metaheuristics: A bibliography
- A non-binary constraint ordering heuristic for constraint satisfaction problems
- An empirical study of phase transitions in binary constraint satisfaction problems
- Combining qualitative and quantitative constraints in temporal reasoning
- Multiway spatial joins
- A Logical Approach to Constraint Satisfaction
- Constraint satisfaction -- algorithms and complexity analysis
This page was built for publication: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332852)
