Revisiting the soft global cardinality constraint

DOI10.1007/978-3-642-13520-0_33MaRDI QIDQ3569941zbMATH OpenOpenAlexFDO

Authors Pierre Schaus, Pascal Van Hentenryck, Alessandro Zanarini

Publication date 22 June 2010

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13520-0_33

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004
• Cost-based arc consistency for global cardinality constraints
• Tight LP-Relaxations of Overlapping Global Cardinality Constraints
• Generalizations of the Global Cardinality Constraint for Hierarchical Resources

Cited in

(6)

• Generalizations of the Global Cardinality Constraint for Hierarchical Resources
• Soft-regular with a prefix-size violation measure
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Cost-based arc consistency for global cardinality constraints
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• The complexity of global cardinality constraints

Describes a project that uses

Uses Software

• COMET

This page was built for publication: Revisiting the soft global cardinality constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569941)