Probabilistic analysis of a routing problem

MaRDI QIDQ5264750zbMATH OpenFDO

Authors A. M. Istomin

Publication date 27 July 2015

zbMATH Keywords

approximation algorithmvehicle routing problemprobabilistic analysisguarantee approximation ratio

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
• Probabilistic analysis of a capacitated vehicle routing problem. II
• scientific article; zbMATH DE number 4066604
• Probabilistic analysis for a multiple depot vehicle routing problem
• scientific article; zbMATH DE number 4066603

Cited in

(12)

• Iterated tour partitioning for Euclidean capacitated vehicle routing
• A Class of Euclidean Routing Problems with General Route Cost Functions
• Probabilistic analysis of a network design problem heuristic
• Probabilistic analyses and practical algorithms for inventory-routing models
• On Euclidean vehicle routing with allocation
• Derivatives of likelihood ratios and smoothed perturbation analysis for the routing problem
• Vehicle routing on road networks: how good is Euclidean approximation?
• Probabilistic analysis for a multiple depot vehicle routing problem
• On Euclidean Vehicle Routing with Allocation
• scientific article; zbMATH DE number 4066604 (Why is no real title available?)
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
• Probabilistic a priori routing-location problems

This page was built for publication: Probabilistic analysis of a routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264750)