Lagrangian relaxation for the time-dependent combined network design and routing problem.
Dimitri PapadimitriouBernard FortzEnrico GorgonePublished in: ICC (2015)
Keyphrases
- network design
- routing problem
- lagrangian relaxation
- network design problem
- travel time
- facility location
- shortest path
- integer programming
- np hard
- lower bound
- linear programming
- cutting plane algorithm
- branch and bound algorithm
- column generation
- feasible solution
- communication networks
- vehicle routing problem
- vehicle routing problem with time windows
- bi objective
- network architecture
- dynamic programming
- lower and upper bounds
- mixed integer programming
- routing algorithm
- upper bound
- valid inequalities
- approximation algorithms
- neural network model
- global optimization
- road network
- branch and bound