The following pages link to Orbitopal fixing (Q408377):
Displaying 30 items.
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- Orbital branching (Q623461) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← 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)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← 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)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Parity polytopes and binarization (Q2283103) (← links)
- Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- Polytopes associated with symmetry handling (Q2414904) (← links)
- Extended Formulations for Packing and Partitioning Orbitopes (Q3169060) (← links)
- The Power of Optimization Over Randomization in Designing Experiments Involving Small Samples (Q3465589) (← links)
- Optimization for Power Systems and the Smart Grid (Q5351612) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
