Pages that link to "Item:Q5900317"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900317):
Displaying 18 items.
- Structural decompositions for problems with global constraints (Q272005) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique (Q487628) (← links)
- The extended global cardinality constraint: an empirical survey (Q543616) (← links)
- An efficient bounds consistency algorithm for the global cardinality constraint (Q816677) (← links)
- Complete bound consistency for the global cardinality constraint (Q816681) (← links)
- Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints (Q840817) (← links)
- Multiconsistency and robustness with global constraints (Q857890) (← links)
- Global constraint catalogue: past, present and future (Q879974) (← links)
- Models for global constraint applications (Q879975) (← links)
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction (Q2342595) (← links)
- Tractable cases of the extended global cardinality constraint (Q2430356) (← links)
- A CSP search algorithm with responsibility sets and kernels (Q2454814) (← links)
- Enhancing set constraint solvers with lexicographic bounds (Q2476614) (← links)
- Bucket elimination for multiobjective optimization problems (Q2506234) (← links)
- Breaking Symmetry of Interchangeable Variables and Values (Q3523071) (← links)
- Bounds of graph parameters for global constraints (Q3534209) (← links)
- Generalizing Global Constraints Based on Network Flows (Q5302729) (← links)