A non-binary constraint ordering heuristic for constraint satisfaction problems
From MaRDI portal
Publication:2425983
DOI10.1016/j.amc.2007.08.064zbMath1133.68434OpenAlexW2072638944MaRDI QIDQ2425983
Publication date: 17 April 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.08.064
Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Distributed CSPs by graph partitioning
- Network-based heuristics for constraint-satisfaction problems
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- On forward checking for non-binary constraint satisfaction.
- Maintenance scheduling problems as benchmarks for constraint algorithms
- A Sufficient Condition for Backtrack-Free Search
- Backtrack programming techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A non-binary constraint ordering heuristic for constraint satisfaction problems