Pages that link to "Item:Q5897222"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2003 (Q5897222):
Displayed 7 items.
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Complete bound consistency for the global cardinality constraint (Q816681) (← links)
- Approximated consistency for the automatic recording constraint (Q1010285) (← links)
- Cost-based filtering for shorter path constraints (Q2454811) (← links)
- The complexity of reasoning with global constraints (Q2454812) (← links)
- Bucket elimination for multiobjective optimization problems (Q2506234) (← links)
- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints (Q5387639) (← links)