All-different polytopes

DOI10.1023/A:1014804110661MaRDI QIDQ1610663zbMATH OpenFDO

Authors Jon Lee

Publication date 20 August 2002

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

zbMATH Keywords

integer programmingconstraint programmingpolytopeedge-coloringfacetall differnt

Mathematics Subject Classification ID

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

Recommendations

• Polytopes
• scientific article; zbMATH DE number 1368684
• Polytopes in arrangements
• scientific article; zbMATH DE number 5174291
• Polyhedrality in pieces
• The polytope of all triangulations of a point configuration
• A Panoply of Polygons
• scientific article; zbMATH DE number 1026567

Cited in

(13)

• Invariants for time-series constraints
• In situ column generation for a cutting-stock problem
• 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 supernodal formulation of vertex colouring with applications in course timetabling
• A short convex-hull proof for the all-different system with the inclusion property
• Mixed integer linear programming formulation techniques
• A polyhedral approach to the \textit{alldifferent} system
• Parsimonious binary-encoding in integer programming
• Automatic Generation of Symmetry-Breaking Constraints
• Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
• Forbidden vertices
• Matrices with lexicographically-ordered rows

This page was built for publication: All-different polytopes

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