Article ID Journal Published Year Pages File Type
10524028 Operations Research Letters 2005 6 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the complexity of the k-customer vehicle routing problem
Authors
, ,