Efficient algorithms for singleton arc consistency
From MaRDI portal
Recommendations
- Theoretical analysis of singleton arc consistency and its extensions
- New algorithms for bidirectional singleton arc consistency
- scientific article; zbMATH DE number 2080318
- Partial (neighbourhood) singleton arc consistency for constraint satisfaction problems
- On the Integration of Singleton Consistencies and Look-Ahead Heuristics
Cites work
- An optimal coarse-grained arc consistency algorithm
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Consistency in networks of relations
- Domain filtering consistencies
- scientific article; zbMATH DE number 2080318 (Why is no real title available?)
- Partition search for non-binary constraint satisfaction
- Principles of Constraint Programming
- Theoretical analysis of singleton arc consistency and its extensions
Cited in
(14)- A distributed arc-consistency algorithm
- Automatically improving constraint models in Savile Row
- On tree-preserving constraints
- Revisiting restricted path consistency
- Neighborhood singleton consistencies
- Theoretical analysis of singleton arc consistency and its extensions
- Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
- New algorithms for max restricted path consistency
- scientific article; zbMATH DE number 2080318 (Why is no real title available?)
- New algorithms for bidirectional singleton arc consistency
- Partial (neighbourhood) singleton arc consistency for constraint satisfaction problems
- On the Integration of Singleton Consistencies and Look-Ahead Heuristics
- Super-reparametrizations of weighted CSPs: properties and optimization perspective
- Singleton node consistency for quadratic assignment problems in cost function networks
This page was built for publication: Efficient algorithms for singleton arc consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430358)