Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems.
René van BevernChristian KomusiewiczManuel SorgePublished in: ATMOS (2015)
Keyphrases
- approximation algorithms
- routing problem
- network design problem
- np hard
- facility location problem
- special case
- vertex cover
- minimum cost
- vehicle routing problem
- set cover
- open shop
- worst case
- randomized algorithms
- optimal solution
- approximation ratio
- approximation schemes
- primal dual
- precedence constraints
- constant factor
- polynomial time approximation
- undirected graph
- branch and bound algorithm
- lower bound
- np hardness
- multi item
- lot sizing
- integer programming
- facility location
- linear programming
- simulated annealing
- scheduling problem