A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
From MaRDI portal
(Redirected from Publication:4286934)
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35)
Recommendations
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- scientific article; zbMATH DE number 4066603
- Probabilistic analysis of a capacitated vehicle routing problem. II
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
- Probabilistic analysis of a capactiated vehicle routing problem—I
Cited in
(7)- Routing problems: A bibliography
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
- Tour splitting algorithms for vehicle routing problems
- scientific article; zbMATH DE number 4066603 (Why is no real title available?)
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- Probabilistic Analysis of a Combined Aggregation and Math Programming Heuristic for a General Class of Vehicle Routing and Scheduling Problems
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
This page was built for publication: A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286934)
