Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs.
Luis Eduardo Neves GouveiaMaria João LopesPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- spanning tree
- network design problem
- network flow problem
- valid inequalities
- minimum total cost
- fixed charge
- minimum cost
- mixed integer programming
- np complete
- total cost
- optimization problems
- traveling salesman problem
- linear programming
- column generation
- cutting plane
- np hard
- mixed integer
- lot sizing
- knapsack problem
- minimal cost
- transportation networks
- branch and bound
- capacity expansion