Probabilistic analysis of a routing problem

zbMATH Open1324.90017MaRDI QIDQ5264750FDOQ5264750

Authors: A. M. Istomin 

Publication date: 27 July 2015

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

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)

Cited In (12)

• 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
• Derivatives of likelihood ratios and smoothed perturbation analysis for the routing problem
• On Euclidean vehicle routing with allocation
• 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
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
• Title not available (Why is that?)
• Probabilistic a priori routing-location problems
• Iterated tour partitioning for Euclidean capacitated vehicle routing

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)