Symmetry-breaking inequalities for ILP with structured sub-symmetry

DOI10.1007/S10107-020-01491-4MaRDI QIDQ2196292zbMATH OpenOpenAlexFDO

Authors Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner

Publication date 28 August 2020

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-020-01491-4

zbMATH Keywords

graph coloringunit commitmentsub-symmetriessymmetry-breaking inequalities

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Integer programming (90C10)

Recommendations

• Sub-symmetry-breaking inequalities for ILP with structured symmetry
• Modified orbital branching for structured symmetry with an application to unit commitment
• Symmetry breaking inequalities from the Schreier-Sims table
• Symmetry in integer linear programming
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem

Cites work

• scientific article; zbMATH DE number 3628712 (Why is no real title available?)
• A Column Generation Approach for Graph Coloring
• A polyhedral approach for graph coloring
• A supernodal formulation of vertex colouring with applications in course timetabling
• Acyclic orientations with path constraints
• An exact approach for the vertex coloring problem
• Branched polyhedral systems
• Describing orbitopes by linear inequalities and projection based tools.
• Detecting orbitopal symmetries
• Exact solution of graph coloring problems via constraint programming and column generation
• Exploiting orbits in symmetric ILP
• Facets of the graph coloring polytope
• Fundamental Domains for Integer Programs with Symmetries
• Modified orbital branching for structured symmetry with an application to unit commitment
• New methods to color the vertices of a graph
• On the complexity of the unit commitment problem
• Orbital branching
• Orbitopal Fixing
• Packing and partitioning orbitopes
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Sub-symmetry-breaking inequalities for ILP with structured symmetry
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• The min-up/min-down unit commitment polytope

Cited in

(3)

• Symmetric ILP: Coloring and small integers
• Efficient symmetry breaking formulations for the job grouping problem
• Sub-symmetry-breaking inequalities for ILP with structured symmetry

This page was built for publication: Symmetry-breaking inequalities for ILP with structured sub-symmetry

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