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

DOI10.1007/S10107-014-0812-YMaRDI QIDQ2340280zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

symmetryinteger programmingunit commitmentorbitopesorbital branching

Mathematics Subject Classification ID

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

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

(18)

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

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)