Pages that link to "Item:Q5900328"

The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900328):

Displaying 20 items.

• Tractability-preserving transformations of global cost functions (Q309935) (← links)
• Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
• Global propagation of side constraints for solving over-constrained problems (Q545560) (← 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)
• Symmetry breaking constraints for value symmetries in constraint satisfaction (Q850460) (← links)
• Symmetry definitions for constraint satisfaction problems (Q850464) (← links)
• Filtering algorithms for the NValue constraint (Q857887) (← links)
• The power of propagation: when GAC is enough (Q1701225) (← links)
• How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
• Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
• On the reification of global constraints (Q2342583) (← links)
• Tractable cases of the extended global cardinality constraint (Q2430356) (← links)
• The complexity of reasoning with global constraints (Q2454812) (← links)
• Efficient constraint propagation for graph coloring (Q2840716) (← links)
• The Complexity of Integer Bound Propagation (Q2996913) (← links)
• Parameterized Complexity Results in Symmetry Breaking (Q3058684) (← links)
• Global Constraints: A Survey (Q3064560) (← links)
• On the Implementation of Global Abduction (Q5302008) (← links)
• Principles and Practice of Constraint Programming – CP 2003 (Q5897227) (← links)