Pages that link to "Item:Q1277773"
From MaRDI portal
The following pages link to Using constraint metaknowledge to reduce arc consistency computation (Q1277773):
Displaying 12 items.
- Constraint satisfaction -- algorithms and complexity analysis (Q672029) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- STR3: a path-optimal filtering algorithm for table constraints (Q2341830) (← links)
- Theoretical analysis of singleton arc consistency and its extensions (Q2389615) (← links)
- On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
- An optimal coarse-grained arc consistency algorithm (Q2457664) (← links)
- A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems (Q5403428) (← links)
- Integrating operations research in constraint programming (Q5898341) (← links)
- Integrating operations research in constraint programming (Q5900889) (← links)
- Constraint reasoning (Q6602253) (← links)