Branch-and-cut strategies for a multi-period network design and routing problem.
Bernard FortzDimitri PapadimitriouPublished in: CoDIT (2014)
Keyphrases
- multi period
- network design
- routing problem
- facility location
- facility location problem
- communication networks
- vehicle routing problem
- network architecture
- production planning
- global optimization
- routing algorithm
- data envelopment analysis
- planning horizon
- search strategies
- travel time
- traveling salesman problem
- shortest path
- total cost
- optimal strategy
- special case
- benchmark problems
- distributed databases
- particle swarm optimization
- cost function