Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
From MaRDI portal
Publication:2227540
DOI10.1007/s10107-019-01457-1zbMath1459.90129arXiv1710.10189OpenAlexW2995196401WikidataQ126563436 ScholiaQ126563436MaRDI QIDQ2227540
Cécile Rottner, Pascale Bendotti, Pierre Fouilhoux
Publication date: 15 February 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10189
Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (4)
Efficient MIP techniques for computing the relaxation complexity ⋮ An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Strong IP formulations need large coefficients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orbitopal fixing
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Orbital branching
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Packing and partitioning orbitopes
- Exploiting orbits in symmetric ILP
- The min-up/min-down unit commitment polytope
- On the complexity of the unit commitment problem
- A computational comparison of symmetry handling methods for mixed integer programs
- Modified orbital branching for structured symmetry with an application to unit commitment
- Polytopes associated with symmetry handling
- Constraint Orbital Branching
- Groupoids and Conditional Symmetry
- Conditional Symmetry Breaking
- Symmetry in Integer Linear Programming
- Branched Polyhedral Systems
- Fundamental Domains for Integer Programs with Symmetries
- Detecting Orbitopal Symmetries
This page was built for publication: Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
