Modified orbital branching for structured symmetry with an application to unit commitment
From MaRDI portal
Publication:2340280
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
Cites work
- Branched polyhedral systems
- Exploiting orbits in symmetric ILP
- Fundamental Domains for Integer Programs with Symmetries
- Improving Discrete Model Representations via Symmetry Considerations
- Orbital branching
- Orbitopal fixing
- Packing and partitioning orbitopes
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Pruning by isomorphism in branch-and-cut
- Recent progress in modeling unit commitment problems
- Symmetry groups, semidefinite programs, and sums of squares
- Trivial integer programs unsolvable by branch-and-bound
Cited in
(21)- The min-up/min-down unit commitment polytope
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- Large-scale unit commitment under uncertainty: an updated literature survey
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Political districting to minimize cut edges
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- 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
- Sub-symmetry-breaking inequalities for ILP with structured symmetry
- Polytopes associated with symmetry handling
- 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
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- Optimization for Power Systems and the Smart Grid
- On the geometry of symmetry breaking inequalities
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Exploiting symmetry for the job sequencing and tool switching problem
- A unified framework for symmetry handling
- Reformulations of separable quadratic optimization problems with symmetric structures via variable aggregation
- Structure-preserving symmetry presolving for mixed-binary linear problems
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)
