Approximation Algorithms for Capacitated Location Routing.
Tobias HarksFelix G. KönigJannik MatuschkePublished in: Transp. Sci. (2013)
Keyphrases
- approximation algorithms
- np hard
- network design problem
- facility location problem
- routing problem
- special case
- vertex cover
- worst case
- minimum cost
- primal dual
- approximation ratio
- travel distance
- routing algorithm
- open shop
- vehicle routing problem
- set cover
- linear programming
- integer programming
- np hardness
- randomized algorithms
- multi item
- constant factor
- wireless sensor networks
- lower bound
- combinatorial auctions
- lot sizing
- scheduling problem