On the complexity of the \(k\)-customer vehicle routing problem
From MaRDI portal
Publication:1886800
DOI10.1016/j.orl.2004.04.003zbMath1076.90061MaRDI QIDQ1886800
Refael Hassin, Shlomi Rubinstein
Publication date: 19 November 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.04.003
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Related Items
Differential approximation algorithm of FSMVRP, Minimum-weight cycle covers and their approximability, An approximation algorithm for the traveling tournament problem, Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route, Minimum-Weight Cycle Covers and Their Approximability
Cites Work