The following pages link to Orbital branching (Q623461):
Displaying 37 items.
- Incremental network design with shortest paths (Q296857) (← links)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- Optimal booking and scheduling in outpatient procedure centers (Q337067) (← links)
- Orbitopal fixing (Q408377) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Algorithms for highly symmetric linear and integer programs (Q1942261) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
- An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem (Q2227540) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- Analysis of models for the stochastic outpatient procedure scheduling problem (Q2315628) (← links)
- Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280) (← links)
- Polytopes associated with symmetry handling (Q2414904) (← links)
- Exploiting symmetry in integer convex optimization using core points (Q2450624) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
- Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times (Q6052537) (← links)
- Optimizing edge sets in networks to produce ground truth communities based on modularity (Q6066243) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
