scientific article; zbMATH DE number 2011863

zbMath1032.90074MaRDI QIDQ4437515

Refael Hassin, Jérôme Monnot, Cristina Bazgan

Publication date: 2 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530277.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

TSPapproximation algorithmdifferential ratioVRP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

On the complexity of the \(k\)-customer vehicle routing problem, Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)