The following pages link to Orbitopal Fixing (Q5429259):
Displaying 12 items.
- Orbitopal fixing (Q408377) (← links)
- Elective course planning (Q420895) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Orbital branching (Q623461) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
