Approximation algorithms for group prize-collecting and location-routing problems.
Hagai GlicksmanMichal PennPublished in: Discret. Appl. Math. (2008)
Keyphrases
- approximation algorithms
- routing problem
- prize collecting
- travel time
- np hard
- vehicle routing problem
- vertex cover
- special case
- worst case
- minimum cost
- approximation ratio
- constant factor
- exact algorithms
- primal dual
- routing algorithm
- precedence constraints
- constant factor approximation
- traveling salesman problem
- shortest path
- multi objective
- partial order
- road network
- global optimization
- particle swarm optimization