Two-Stage Stochastic Programming for Transportation Network Design Problem.
Dusan HrabecPavel PopelaJan RoupecJan MazalPetr StodolaPublished in: MENDEL (2015)
Keyphrases
- network design problem
- benders decomposition
- distribution centers
- transportation networks
- network design
- approximation algorithms
- network flow problem
- traveling salesman problem
- minimal cost
- branch and bound
- travel time
- mixed integer
- integer programming
- road network
- mixed integer programming
- transportation problem
- valid inequalities
- lower bound
- lagrangian relaxation
- lot sizing
- branch and bound algorithm
- upper bound
- np hard
- special case