Strong Lower Bounds for a Survivable Network Design Problem.
Markus LeitnerGünther R. RaidlPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- network design problem
- lower bound
- branch and bound
- lagrangian relaxation
- upper bound
- branch and bound algorithm
- approximation algorithms
- benders decomposition
- valid inequalities
- network design
- lower and upper bounds
- np hard
- column generation
- worst case
- optimal solution
- objective function
- search algorithm
- minimal cost
- exact solution
- mixed integer programming
- cutting plane
- transportation networks
- mixed integer
- search space
- neural network
- integer programming
- linear programming
- scheduling problem
- integer program