Cardinality constraints and systems of restricted representatives

DOI10.1007/s10878-014-9810-5zbMath1342.90189OpenAlexW2053148226MaRDI QIDQ266031

Ioannis Mourtos

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9810-5

zbMATH Keywords

constraint programmingpolyhedral combinatoricsglobal cardinality constraint

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• An efficient bounds consistency algorithm for the global cardinality constraint
• Complete bound consistency for the global cardinality constraint
• Simultaneous matchings: Hardness and approximation
• The ellipsoid method and its consequences in combinatorial optimization
• Tight representation of logical constraints as cardinality rules
• On unions and dominants of polytopes
• Transversal theory. An account of some aspects of combinatorial mathematics
• Cost-based arc consistency for global cardinality constraints
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Graph coloring inequalities from all-different systems
• A polyhedral approach to the \textit{alldifferent} system
• Tractable cases of the extended global cardinality constraint
• Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
• The Role of Integer Programming Techniques in Constraint Programming's Global Constraints
• On the Facial Structure of the Alldifferent System
• Network Flow and Systems of Representatives
• Tight LP-Relaxations of Overlapping Global Cardinality Constraints
• Recent Advances in Constraints

This page was built for publication: Cardinality constraints and systems of restricted representatives