On the complexity of the k-customer vehicle routing problem |
| |
| Authors: | Refael Hassin Shlomi Rubinstein |
| |
| Affiliation: | Department of Statistics and Operations Research, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel |
| |
| Abstract: | ![]()
We investigate the complexity of the k-CUSTOMER VEHICLE ROUTING PROBLEM: Given an edge weighted graph, the problem requires to compute a minimum weight set of cyclic routes such that each contains a distinguished depot vertex and at most other k customer vertices, and every customer belongs to exactly one route. |
| |
| Keywords: | Approximation algorithms Vehicle routing problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
