On the complexity of the \(k\)-customer vehicle routing problem

DOI10.1016/j.orl.2004.04.003zbMath1076.90061OpenAlexW1994993627MaRDI 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

zbMATH Keywords

Approximation algorithmsVehicle routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (7)

Differential approximation algorithm of FSMVRP ⋮ Greedy cycles in the star graphs ⋮ Minimum-Weight Cycle Covers and Their Approximability ⋮ A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems ⋮ 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

• On the \(k\)-path partition of graphs.
• Bounds and Heuristics for Capacitated Routing Problems
• On the completeness of a generalized matching problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of the \(k\)-customer vehicle routing problem