Orbital branching
From MaRDI portal
Publication:623461
DOI10.1007/S10107-009-0273-XzbMath1206.90101OpenAlexW2914080086MaRDI QIDQ623461
Fabrizio Rossi, Stefano Smriglio, James Ostrowski, Jeff Linderoth
Publication date: 14 February 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0273-x
Related Items (45)
Detecting almost symmetries of graphs ⋮ Exploiting symmetries in mathematical programming via orbital independence ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Incremental network design with shortest paths ⋮ A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space ⋮ Optimal booking and scheduling in outpatient procedure centers ⋮ Reduction of orbits of finite Coxeter groups of non-crystallographic type ⋮ Orbital Independence in Symmetric Mathematical Programs ⋮ Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs ⋮ Equivalence of Lattice Orbit Polytopes ⋮ Polytopes associated with symmetry handling ⋮ Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times ⋮ Handling symmetries in mixed-integer semidefinite programs ⋮ Optimizing edge sets in networks to produce ground truth communities based on modularity ⋮ Optimization for Power Systems and the Smart Grid ⋮ Orbitopal fixing ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Symmetry-breaking inequalities for ILP with structured sub-symmetry ⋮ Algorithms for highly symmetric linear and integer programs ⋮ An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ 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 ⋮ An exact approach for the multi-constraint graph partitioning problem ⋮ Exploiting symmetry in integer convex optimization using core points ⋮ Optimization Bounds from the Branching Dual ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ Stabilizer-based symmetry breaking constraints for mathematical programs ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Solving large Steiner Triple Covering Problems ⋮ Orbital shrinking: theory and applications ⋮ On solving a hard quadratic 3-dimensional assignment problem ⋮ On the geometry of symmetry breaking inequalities ⋮ On the geometry of symmetry breaking inequalities ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension ⋮ Analysis of models for the stochastic outpatient procedure scheduling problem ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ Fundamental Domains for Symmetric Optimization: Construction and Search ⋮ Modified orbital branching for structured symmetry with an application to unit commitment ⋮ Political districting to minimize cut edges ⋮ Classical symmetries and the quantum approximate optimization algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing and partitioning orbitopes
- MINTO, a Mixed INTeger Optimizer
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Exploiting orbits in symmetric ILP
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
- Branching rules revisited
- A branch-and-cut algorithm for graph coloring
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Improving Discrete Model Representations via Symmetry Considerations
- Constraint Orbital Branching
- A Computational Study of Search Strategies for Mixed Integer Programming
- Football Pools--A Game for Mathematicians
- Orbitopal Fixing
- Orbital Branching
- Benchmarking optimization software with performance profiles.
This page was built for publication: Orbital branching