scientific article; zbMATH DE number 2011863

MaRDI QIDQ4437515zbMATH OpenFDO

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

zbMATH Keywords

approximation algorithmdifferential ratioTSPVRP

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for some vehicle routing problems
• New differential approximation algorithm for \(k\)-customer vehicle routing problem
• Differential approximation algorithm of FSMVRP
• Algorithms and Data Structures
• On the Distance Constrained Vehicle Routing Problem

Cited in

(10)

• New inequalities for the general routing problem
• Approximation algorithms for some vehicle routing problems
• On the complexity of the \(k\)-customer vehicle routing problem
• Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
• Differential approximation algorithm of FSMVRP
• Differential approximation of NP-hard problems with equal size feasible solutions
• Derivatives of likelihood ratios and smoothed perturbation analysis for the routing problem
• Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
• New differential approximation algorithm for \(k\)-customer vehicle routing problem

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)