Pages that link to "Item:Q3611965"
From MaRDI portal
The following pages link to Fundamental Domains for Integer Programs with Symmetries (Q3611965):
Displayed 24 items.
- Orbitopal fixing (Q408377) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Variable symmetry breaking in numerical constraint problems (Q900305) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Algorithms for highly symmetric linear and integer programs (Q1942261) (← 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)
- 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)
- Exploiting symmetry in integer convex optimization using core points (Q2450624) (← 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)
- Symmetry in Mathematical Programming (Q2897300) (← links)
- Equivalence of Lattice Orbit Polytopes (Q4564021) (← links)
- Fundamental Domains for Symmetric Optimization: Construction and Search (Q5003215) (← links)
- Automatic Generation of Symmetry-Breaking Constraints (Q5505671) (← links)
- On the geometry of symmetry breaking inequalities (Q5918422) (← links)
- On the geometry of symmetry breaking inequalities (Q5925642) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)