Benders decomposition approach for the robust network design problem with flow bifurcations.
Chungmok LeeKyungsik LeeSungsoo ParkPublished in: Networks (2013)
Keyphrases
- network design problem
- benders decomposition
- network design
- mixed integer
- approximation algorithms
- branch and bound
- transportation networks
- mixed integer programming
- minimal cost
- exact algorithms
- integer programming
- lagrangian relaxation
- branch and bound algorithm
- neural network
- valid inequalities
- optimal solution
- linear programming
- exact solution
- np hard
- nonlinear programming
- genetic algorithm