On the weight-constrained minimum spanning tree problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Fast separation algorithms for three-index assignment problems
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
Computational Optimization and Applications
| Hi-index | 0.00 |
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms for them, i.e., routines for detecting when they are violated. We present new exact and heuristic separation algorithms for several classes of inequalities, namely lifted cover, extended cover, weight and lifted pack inequalities. Moreover, we show how to improve a recent separation algorithm for the 0-1 knapsack polytope itself. Extensive computational results, on MIPLIB and OR Library instances, show the strengths and limitations of the inequalities and algorithms considered.