Revisiting the soft global cardinality constraint

DOI10.1007/978-3-642-13520-0_33zbMATH Open1285.68164OpenAlexW1636383167MaRDI QIDQ3569941FDOQ3569941

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

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

Mathematics Subject Classification ID

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

Cited In (6)

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

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)