Symmetry-breaking inequalities for ILP with structured sub-symmetry
DOI10.1007/S10107-020-01491-4zbMATH Open1450.90010OpenAlexW3014829169MaRDI QIDQ2196292FDOQ2196292
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Integer programming (90C10)
Cites Work
- Facets of the graph coloring polytope
- New methods to color the vertices of a graph
- An exact approach for the vertex coloring problem
- Packing and partitioning orbitopes
- A Column Generation Approach for Graph Coloring
- Orbital branching
- Title not available (Why is that?)
- A supernodal formulation of vertex colouring with applications in course timetabling
- Exact solution of graph coloring problems via constraint programming and column generation
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
- On the complexity of the unit commitment problem
- Exploiting orbits in symmetric ILP
- Fundamental Domains for Integer Programs with Symmetries
- Orbitopal Fixing
- Branched polyhedral systems
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Detecting orbitopal symmetries
- Describing orbitopes by linear inequalities and projection based tools.
- A polyhedral approach for graph coloring
- Acyclic orientations with path constraints
- The min-up/min-down unit commitment polytope
- Modified orbital branching for structured symmetry with an application to unit commitment
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem
- Sub-symmetry-breaking inequalities for ILP with structured symmetry
Cited In (3)
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)
