Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem.

Michael Yu. Khachay Helen Zaytseva

Published in: COCOA (2015)

Keyphrases

polynomial time approximation
np hard
approximation algorithms
vehicle routing problem
error bounds
metaheuristic
identical machines
lower bound
theoretical analysis
particle swarm optimization
constraint satisfaction problems
constraint satisfaction
knapsack problem