Publication:4437515
From MaRDI portal
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
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s), On the complexity of the \(k\)-customer vehicle routing problem
