Pages that link to "Item:Q486387"
From MaRDI portal
The following pages link to Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387):
Displaying 17 items.
- Efficient symmetry breaking formulations for the job grouping problem (Q340336) (← 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)
- Orbital shrinking: theory and applications (Q1786877) (← 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)
- Polytopes associated with symmetry handling (Q2414904) (← 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)
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints (Q2901053) (← links)
- Orbital Independence in Symmetric Mathematical Programs (Q3467864) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897217) (← 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)
- Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)
