A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints.
Okan ArslanOla JabaliGilbert LaportePublished in: INFORMS J. Comput. (2020)
Keyphrases
- network design problem
- mixed integer
- valid inequalities
- heuristic solution
- mixed integer programming
- linear program
- integer programming
- convex hull
- approximation algorithms
- network design
- branch and bound
- feasible solution
- lp relaxation
- cutting plane
- continuous variables
- lower and upper bounds
- optimal solution
- traveling salesman problem
- integer program
- linear programming
- upper bound
- lagrangian relaxation
- lot sizing
- constraint satisfaction