Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
From MaRDI portal
Recommendations
- Probabilistic analysis of a routing problem
- Probabilistic analysis of a capacitated vehicle routing problem. II
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- Probabilistic analysis for a multiple depot vehicle routing problem
- A Class of Euclidean Routing Problems with General Route Cost Functions
Cites work
- Bounds and Heuristics for Capacitated Routing Problems
- scientific article; zbMATH DE number 4053339 (Why is no real title available?)
- scientific article; zbMATH DE number 4066603 (Why is no real title available?)
- scientific article; zbMATH DE number 1559543 (Why is no real title available?)
- scientific article; zbMATH DE number 871938 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Improved bounds for vehicle routing solutions
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- The minimum latency problem
- The shortest path and the shortest road through n points
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
Cited in
(18)- Probabilistic analysis of a capacitated vehicle routing problem. II
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
- Using regression models to understand the impact of route-length variability in practical vehicle routing
- Probabilistic analyses and practical algorithms for inventory-routing models
- Capacitated vehicle routing with non-uniform speeds
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- Probabilistic analysis for a multiple depot vehicle routing problem
- scientific article; zbMATH DE number 4066604 (Why is no real title available?)
- Probabilistic analysis of a capactiated vehicle routing problem—I
- Derivatives of likelihood ratios and smoothed perturbation analysis for the routing problem
- Probabilistic analysis of a routing problem
- A Class of Euclidean Routing Problems with General Route Cost Functions
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Iterated tour partitioning for Euclidean capacitated vehicle routing
- Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
- Combined route capacity and route length models for unit demand vehicle routing problems
This page was built for publication: Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443715)
