Using constraint metaknowledge to reduce arc consistency computation
From MaRDI portal
Recommendations
Cites work
Cited in
(12)- Constraint propagation techniques for the disjunctive scheduling problem
- STR3: a path-optimal filtering algorithm for table constraints
- Theoretical analysis of singleton arc consistency and its extensions
- Reformulation of global constraints based on constraints checkers
- A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
- Constraint reasoning
- An optimal coarse-grained arc consistency algorithm
- Integrating operations research in constraint programming
- On the speed of constraint propagation and the time complexity of arc consistency testing
- Backjump-based backtracking for constraint satisfaction problems
- Integrating operations research in constraint programming
- Constraint satisfaction -- algorithms and complexity analysis
This page was built for publication: Using constraint metaknowledge to reduce arc consistency computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277773)