A short convex-hull proof for the all-different system with the inclusion property

DOI10.1016/j.orl.2014.11.008zbMath1408.90327OpenAlexW2078057809MaRDI QIDQ1785324

Marco Di Summa

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.11.008

zbMATH Keywords

convex hulltotal dual integralityintegral polyhedronall-different constraint

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

Matrices with lexicographically-ordered rows

Cites Work

• Unnamed Item
• Unnamed Item
• Smallest compact formulation for the permutahedron
• All-different polytopes
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A polyhedral approach to the \textit{alldifferent} system
• Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming

This page was built for publication: A short convex-hull proof for the all-different system with the inclusion property