The following pages link to (Q4735941):
Displayed 11 items.
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Lifting, tilting and fractional programming revisited (Q614041) (← links)
- A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone (Q708346) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- Local cuts revisited (Q1003489) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem (Q1038381) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)