scientific article; zbMATH DE number 2011863
zbMATH Open1032.90074MaRDI QIDQ4437515FDOQ4437515
Authors: 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 of this publication is not available (Why is that?)
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)
Cited In (10)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
- Differential approximation algorithm of FSMVRP
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
- Approximation algorithms for some vehicle routing problems
- On the complexity of the \(k\)-customer vehicle routing problem
- Derivatives of likelihood ratios and smoothed perturbation analysis for the routing problem
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- New inequalities for the general routing problem
- Differential approximation of NP-hard problems with equal size feasible solutions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437515)
