A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs.
Amariah BeckerPhilip N. KleinDavid SaulpicPublished in: ESA (2017)
Keyphrases
- polynomial time approximation
- vehicle routing
- np hard
- approximation algorithms
- error bounds
- travel time
- vehicle routing problem
- column generation
- logistics distribution
- planar graphs
- vehicle routing problems with time windows
- routing problem
- approximation guarantees
- theoretical analysis
- neural network
- greedy algorithm
- shortest path
- np complete
- linear programming
- worst case
- constant factor
- sensor networks
- optimal solution
- genetic algorithm