Tight LP-Relaxations of Overlapping Global Cardinality Constraints

DOI10.1007/978-3-642-38171-3_27MaRDI QIDQ4922926zbMATH OpenOpenAlexFDO

Authors Ioannis Mourtos

Publication date 4 June 2013

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-38171-3_27

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On the structure of linear programs with overlapping cardinality constraints
• The complexity of global cardinality constraints
• Tractable cases of the extended global cardinality constraint
• An efficient bounds consistency algorithm for the global cardinality constraint
• An efficient bounds consistency algorithm for the global cardinality constraint
• Principles and Practice of Constraint Programming – CP 2004
• Complete bound consistency for the global cardinality constraint
• Fast bound consistency for the global cardinality constraint
• scientific article; zbMATH DE number 7753414
• Approximating CSPs with global cardinality constraints using SDP hierarchies

Cited in

(6)

• Cost-based arc consistency for global cardinality constraints
• Cardinality constraints and systems of restricted representatives
• On matrices, automata, and double counting
• Revisiting the soft global cardinality constraint
• Generalizations of the Global Cardinality Constraint for Hierarchical Resources
• Recent Advances in Constraints

This page was built for publication: Tight LP-Relaxations of Overlapping Global Cardinality Constraints

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