Modified orbital branching for structured symmetry with an application to unit commitment
DOI10.1007/S10107-014-0812-YzbMATH Open1309.90059OpenAlexW2013333510MaRDI QIDQ2340280FDOQ2340280
Authors: James P. 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
Recommendations
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
- Exploiting symmetries in mathematical programming via orbital independence
- scientific article; zbMATH DE number 686965
- A Polyhedral Study on Fuel-Constrained Unit Commitment
- A deterministic method for the unit commitment problem in power systems
- Lagrangian duality and branch-and-bound algorithms for optimal power flow
- Orbital independence in symmetric mathematical programs
- Recent progress in modeling unit commitment problems
- The models and optimization method for power system unit commitment problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Integer programming (90C10)
Cites Work
- Symmetry groups, semidefinite programs, and sums of squares
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Packing and partitioning orbitopes
- Orbital branching
- Improving Discrete Model Representations via Symmetry Considerations
- Orbitopal fixing
- Pruning by isomorphism in branch-and-cut
- Exploiting orbits in symmetric ILP
- Fundamental Domains for Integer Programs with Symmetries
- Branched polyhedral systems
- Trivial integer programs unsolvable by branch-and-bound
- Recent progress in modeling unit commitment problems
Cited In (18)
- Exploiting symmetry for the job sequencing and tool switching problem
- Large-scale unit commitment under uncertainty: an updated literature survey
- Modeling flexible generator operating regions via chance-constrained stochastic unit commitment
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- The min-up/min-down unit commitment polytope
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Polytopes associated with symmetry handling
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- On the geometry of symmetry breaking inequalities
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- Optimization for Power Systems and the Smart Grid
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- Sub-symmetry-breaking inequalities for ILP with structured symmetry
- Political districting to minimize cut edges
This page was built for publication: Modified orbital branching for structured symmetry with an application to unit commitment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340280)
