A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems.
Geir DahlMechthild StoerPublished in: INFORMS J. Comput. (1998)
Keyphrases
- network design problem
- cutting plane algorithm
- valid inequalities
- integer programming
- cutting plane
- mixed integer programming
- lagrangian relaxation
- mixed integer
- column generation
- network flow problem
- traveling salesman problem
- linear programming
- feasible solution
- branch and bound
- network design
- lower and upper bounds
- approximation algorithms
- primal dual
- convex hull
- integer program
- np hard
- lower bound
- network flow
- constraint programming
- upper bound
- lp relaxation
- minimal cost
- integer variables
- production planning
- exact solution
- linear program
- scheduling problem
- special case
- objective function