Modified orbital branching for structured symmetry with an application to unit commitment

DOI10.1007/s10107-014-0812-yzbMath1309.90059OpenAlexW2013333510MaRDI QIDQ2340280

James Ostrowski, Miguel F. Anjos, Anthony Vannelli

Publication date: 16 April 2015

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

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/85928083/Modified_Orbital_Branching_for_Structured_Symmetry_with_an_Application_to_Unit_Commitment.pdf

zbMATH Keywords

symmetryinteger programmingunit commitmentorbitopesorbital branching

Mathematics Subject Classification ID

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

Related Items

The min-up/min-down unit commitment polytope, Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs, Polytopes associated with symmetry handling, Optimization for Power Systems and the Smart Grid, Symmetry-breaking inequalities for ILP with structured sub-symmetry, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters, A semidefinite relaxation based global algorithm for two-level graph partition problem, Modeling flexible generator operating regions via chance-constrained stochastic unit commitment, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, Large-scale unit commitment under uncertainty: an updated literature survey, Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem, On Mixed-Integer Programming Formulations for the Unit Commitment Problem, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, On the geometry of symmetry breaking inequalities, Political districting to minimize cut edges

Cites Work

• Orbitopal fixing
• Orbital branching
• Packing and partitioning orbitopes
• Pruning by isomorphism in branch-and-cut
• Exploiting orbits in symmetric ILP
• Symmetry groups, semidefinite programs, and sums of squares
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Improving Discrete Model Representations via Symmetry Considerations
• Branched Polyhedral Systems
• Fundamental Domains for Integer Programs with Symmetries
• Trivial integer programs unsolvable by branch-and-bound
• Recent Progress in Modeling Unit Commitment Problems