New lower bounds for online k-server routing problems.
Irene FinkSven Oliver KrumkeStephan WestphalPublished in: Inf. Process. Lett. (2009)
Keyphrases
- routing problem
- lower bound
- online algorithms
- online learning
- upper bound
- vehicle routing
- vehicle routing problem
- travel time
- depth first search
- branch and bound
- cutting plane algorithm
- branch and bound algorithm
- column generation
- worst case
- cutting plane
- vehicle routing problem with time windows
- real time
- lower and upper bounds
- np hard
- multi objective
- search algorithm