Recommendations
Cites work
- scientific article; zbMATH DE number 3927214 (Why is no real title available?)
- scientific article; zbMATH DE number 124521 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 1284418 (Why is no real title available?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- A branch-and-cut algorithm for graph coloring
- Benchmarking optimization software with performance profiles.
- Branch-and-price: Column generation for solving huge integer programs
- Branching rules revisited
- Constraint Orbital Branching
- Exploiting orbits in symmetric ILP
- Football Pools--A Game for Mathematicians
- Improving Discrete Model Representations via Symmetry Considerations
- MINTO, a Mixed INTeger Optimizer
- Orbital Branching
- Orbitopal Fixing
- Packing and partitioning orbitopes
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
Cited in
(64)- Exploiting symmetries in polyhedral computations
- 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
- A unified framework for symmetry handling
- Large-scale unit commitment under uncertainty: an updated literature survey
- Exploiting symmetry for the job sequencing and tool switching problem
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
- An ILP-based exact approach for solving the variable cost and size bin packing problem with time-dependent cost modeling the shared satellite-based last-mile delivery
- Orbitopal Fixing
- Last fifty years of integer linear programming: a focus on recent practical advances
- 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
- Orbital shrinking: theory and applications
- Orbital shrinking
- Equivalence of lattice orbit polytopes
- Orbital independence in symmetric mathematical programs
- Incremental network design with shortest paths
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Exploiting orbits in symmetric ILP
- Exploiting symmetry in integer convex optimization using core points
- Constraint Orbital Branching
- Polytopes associated with symmetry handling
- A combinatorial approach for small and strong formulations of disjunctive constraints
- 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
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- Symmetry detection in mixed-integer conic programming
- Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond
- Orbital Branching
- Optimizing edge sets in networks to produce ground truth communities based on modularity
- Optimal booking and scheduling in outpatient procedure centers
- Optimizing surgery scheduling under post-anesthesia care unit capacity constraints and random services durations
- Orbitopal fixing
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- On the geometry of symmetry breaking inequalities
- On the geometry of symmetry breaking inequalities
- Reformulations of separable quadratic optimization problems with symmetric structures via variable aggregation
- The storage location assignment and picker routing problem: a generic branch-cut-and-price algorithm
- Using symmetry to optimize over the Sherali-Adams relaxation
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Algorithms and Software for Convex Mixed Integer Nonlinear 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
- An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c
- Fundamental domains for symmetric optimization: construction and search
- Handling sub-symmetry in integer programming using activation handlers
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
- Constructing extremal triangle-free graphs using integer programming
- 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
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- Optimization for Power Systems and the Smart Grid
- Handling symmetries in mixed-integer semidefinite programs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- An ILP approach to determine smallest 4-regular non-Hamiltonian, nontraceable, and nonhomogeneously traceable graphs
- Political districting to minimize cut edges
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)
