The following pages link to (Q4537751):
Displaying 7 items.
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Pruning by isomorphism in branch-and-cut (Q1396814) (← links)
- Exploiting orbits in symmetric ILP (Q1424276) (← links)
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem (Q2227540) (← links)
- Pruning of CRT-sub-trees (Q2258835) (← links)
- Slicing an ear using prune-and-search (Q4274653) (← links)
- Recent Advances in Constraints (Q5703908) (← links)