A non-binary constraint ordering heuristic for constraint satisfaction problems
From MaRDI portal
Publication:2425983
Recommendations
Cites work
- A Sufficient Condition for Backtrack-Free Search
- Backtrack programming techniques
- Distributed CSPs by graph partitioning
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- scientific article; zbMATH DE number 3862974 (Why is no real title available?)
- scientific article; zbMATH DE number 1191711 (Why is no real title available?)
- scientific article; zbMATH DE number 683341 (Why is no real title available?)
- scientific article; zbMATH DE number 2084771 (Why is no real title available?)
- scientific article; zbMATH DE number 3208664 (Why is no real title available?)
- Maintenance scheduling problems as benchmarks for constraint algorithms
- Network-based heuristics for constraint-satisfaction problems
- On forward checking for non-binary constraint satisfaction.
Cited in
(4)
This page was built for publication: A non-binary constraint ordering heuristic for constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425983)