A note on the subadditive network design problem.
MohammadHossein BateniMohammad Taghi HajiaghayiPublished in: Oper. Res. Lett. (2009)
Keyphrases
- network design problem
- mixed integer
- benders decomposition
- network design
- approximation algorithms
- mixed integer programming
- linear program
- branch and bound
- valid inequalities
- transportation networks
- minimal cost
- lot sizing
- feasible solution
- continuous variables
- integer programming
- convex hull
- neural network
- optimal solution
- cutting plane
- lagrangian relaxation
- branch and bound algorithm
- dynamic programming
- np hard
- special case
- search algorithm
- lagrangian heuristic