Strong inequalities for capacitated survivable network design problems.
Daniel BienstockGabriella MuratorePublished in: Math. Program. (2000)
Keyphrases
- network design problem
- capacitated fixed charge
- valid inequalities
- mixed integer
- integer variables
- network design
- approximation algorithms
- mixed integer programming
- network flow problem
- branch and bound
- integer programming
- minimal cost
- traveling salesman problem
- linear programming
- transportation networks
- feasible solution
- lagrangian relaxation
- primal dual
- lot sizing
- convex hull
- np hard
- lower and upper bounds
- cutting plane
- column generation
- linear program