The undirected m-Capacitated Peripatetic Salesman Problem.
Éric DuchêneGilbert LaporteFrédéric SemetPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- single source
- lot sizing
- directed graph
- vehicle routing problem
- routing problem
- np hard
- facility location
- multi item
- multi commodity
- capacity constraints
- facility location problem
- weighted graph
- network design problem
- vehicle routing problem with stochastic demands
- multi source
- multi period
- network flow problem
- production inventory
- directed edges
- undirected graph
- branch and bound
- random walk
- computational complexity
- multicommodity flow
- data sets