Computational experience with general cutting planes for the Set Covering problem.
Pasquale AvellaMaurizio BocciaIgor Vasil'evPublished in: Oper. Res. Lett. (2009)
Keyphrases
- cutting plane
- set covering problem
- integer programming
- column generation
- set covering
- integer programming problems
- special case
- lower bound
- branch and bound algorithm
- integer program
- valid inequalities
- linear programming
- mixed integer
- linear program
- branch and bound
- knapsack problem
- network flow
- lagrangian relaxation
- optimal solution
- np hard
- search algorithm