All-different polytopes

DOI10.1023/A:1014804110661zbMath1007.90041MaRDI QIDQ1610663

Jon Lee

Publication date: 20 August 2002

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

zbMATH Keywords

integer programmingedge-coloringpolytopeconstraint programmingfacetall differnt

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (13)

Invariants for time-series constraints ⋮ Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations ⋮ In situ column generation for a cutting-stock problem ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ Matrices with lexicographically-ordered rows ⋮ A polyhedral approach to the \textit{alldifferent} system ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation ⋮ A short convex-hull proof for the all-different system with the inclusion property ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Automatic Generation of Symmetry-Breaking Constraints ⋮ Forbidden Vertices ⋮ Parsimonious binary-encoding in integer programming

This page was built for publication: All-different polytopes