The following pages link to Packing and partitioning orbitopes (Q925263):
Displaying 38 items.
- A polyhedral investigation of star colorings (Q284838) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- Discrete optimization methods to fit piecewise affine models to data points (Q342537) (← links)
- Orbitopal fixing (Q408377) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Orbital branching (Q623461) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- Algorithms for highly symmetric linear and integer programs (Q1942261) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← 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)
- Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- Matrices with lexicographically-ordered rows (Q2414107) (← links)
- Polytopes associated with symmetry handling (Q2414904) (← links)
- On the combinatorics of the 2-class classification problem (Q2419359) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- Employee workload balancing by graph partitioning (Q2448894) (← links)
- Exploiting symmetry in integer convex optimization using core points (Q2450624) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Symmetry in Mathematical Programming (Q2897300) (← links)
- Orbital Independence in Symmetric Mathematical Programs (Q3467864) (← links)
- Spherical cuts for integer programming problems (Q3499437) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- A branch-and-cut algorithm for the connected max-\(k\)-cut problem (Q6069218) (← 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)
