Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem.
Dilson Lucas PereiraAlexandre Salles da CunhaGeraldo Robson MateusPublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- minimum cost
- linear relaxation
- column generation
- np hard
- approximation algorithms
- spanning tree
- set partitioning
- network flow
- network flow problem
- lower bound
- branch and bound
- integer program
- integer programming
- linear program
- linear programming
- vehicle routing
- lagrangian relaxation
- integer linear programming
- optimal solution
- upper bound
- mixed integer programming
- cutting plane
- lagrangean relaxation
- linear programming problems
- special case
- minimum cost path
- relaxation algorithm
- scheduling problem
- valid inequalities
- worst case