The convex hull of two core capacitated network design problems.
Thomas L. MagnantiPrakash MirchandaniRita VachaniPublished in: Math. Program. (1993)
Keyphrases
- network design problem
- convex hull
- mixed integer
- valid inequalities
- network flow problem
- feasible solution
- mixed integer programming
- approximation algorithms
- network design
- minimal cost
- branch and bound
- transportation networks
- cutting plane
- lagrangian relaxation
- integer variables
- convex polyhedra
- lp relaxation
- integer programming
- training samples
- linear program
- data points
- search space