On cut-based inequalities for capacitated network design polyhedra.
Christian RaackArie M. C. A. KosterSebastian OrlowskiRoland WessälyPublished in: Networks (2011)
Keyphrases
- network design
- fixed charge
- network design problem
- facility location
- facet defining inequalities
- facet defining
- planar graphs
- valid inequalities
- heuristic solution
- communication networks
- min cut
- convex hull
- network flow problem
- special case
- minimum total cost
- network architecture
- sufficient conditions
- multicommodity flow
- mixed integer
- multi item
- linear programming
- linear program
- data mining
- lp relaxation
- lower and upper bounds
- np hard
- routing problem
- vehicle routing problem