Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints.
Martin GrötschelClyde L. MonmaPublished in: SIAM J. Discret. Math. (1990)
Keyphrases
- network design problem
- integer variables
- mixed integer
- network design
- approximation algorithms
- valid inequalities
- network flow problem
- integer points
- extreme points
- convex hull
- constraint satisfaction
- special case
- transportation networks
- knapsack problem
- mixed integer programming
- lower and upper bounds
- branch and bound
- constraint programming
- scheduling problem
- np hard
- objective function