Orbital branching
From MaRDI portal
Publication:623461
DOI10.1007/S10107-009-0273-XzbMATH Open1206.90101OpenAlexW2914080086MaRDI QIDQ623461FDOQ623461
Fabrizio Rossi, Stefano Smriglio, James P. 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
Recommendations
Cites Work
- Benchmarking optimization software with performance profiles.
- A Computational Study of Search Strategies for Mixed Integer Programming
- Branching rules revisited
- Branch-and-price: Column generation for solving huge integer programs
- A branch-and-cut algorithm for graph coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Packing and partitioning orbitopes
- Title not available (Why is that?)
- Improving Discrete Model Representations via Symmetry Considerations
- Football Pools--A Game for Mathematicians
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
- Title not available (Why is that?)
- Constraint Orbital Branching
- MINTO, a Mixed INTeger Optimizer
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Exploiting orbits in symmetric ILP
- Orbitopal Fixing
- Title not available (Why is that?)
- Orbital Branching
Cited In (49)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
- Classical symmetries and the quantum approximate optimization algorithm
- Analysis of models for the stochastic outpatient procedure scheduling problem
- Exploiting symmetries in mathematical programming via orbital independence
- Exploiting symmetry for the job sequencing and tool switching problem
- Large-scale unit commitment under uncertainty: an updated literature survey
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
- Enabling research through the SCIP Optimization Suite 8.0
- On solving a hard quadratic 3-dimensional assignment problem
- Algorithms for highly symmetric linear and integer programs
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- A computational comparison of symmetry handling methods for mixed integer programs
- Exploiting Symmetries in Polyhedral Computations
- Orbital shrinking: theory and applications
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Incremental network design with shortest paths
- Exploiting orbits in symmetric ILP
- Exploiting symmetry in integer convex optimization using core points
- Fundamental Domains for Symmetric Optimization: Construction and Search
- Constraint Orbital Branching
- Polytopes associated with symmetry handling
- Optimization Bounds from the Branching Dual
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
- Modified orbital branching for structured symmetry with an application to unit commitment
- Optimizing edge sets in networks to produce ground truth communities based on modularity
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- Optimal booking and scheduling in outpatient procedure centers
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Orbitopal fixing
- On the geometry of symmetry breaking inequalities
- On the geometry of symmetry breaking inequalities
- Orbital Independence in Symmetric Mathematical Programs
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Using symmetry to optimize over the Sherali-Adams relaxation
- Stabilizer-based symmetry breaking constraints for mathematical programs
- An exact approach for the multi-constraint graph partitioning problem
- Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times
- Reduction of orbits of finite Coxeter groups of non-crystallographic type
- Equivalence of Lattice Orbit Polytopes
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
- Domain reduction techniques for global NLP and MINLP optimization
- Solving large Steiner Triple Covering Problems
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- Detecting almost symmetries of graphs
- Optimization for Power Systems and the Smart Grid
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- Handling symmetries in mixed-integer semidefinite programs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Political districting to minimize cut edges
Uses Software
This page was built for publication: Orbital branching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623461)
