Improved approximation algorithms for cumulative VRP with stochastic demands
From MaRDI portal
Publication:2181250
DOI10.1016/j.dam.2018.01.012zbMath1444.90026OpenAlexW2793545721MaRDI QIDQ2181250
Apurva Mudgal, Rishi Ranjan Singh, Daya Ram Gaur
Publication date: 18 May 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.01.012
Related Items (1)
Cites Work
- Unnamed Item
- A review of recent research on green road freight transportation
- Stochastic vehicle routing: A comprehensive approach
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Stochastic vehicle routing
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- A heuristic for cumulative vehicle routing using column generation
- Routing vehicles to minimize fuel consumption
- The Truck Dispatching Problem
- Approximation Algorithms for Cumulative VRP with Stochastic Demands
- Technical Note—Approximation Algorithms for VRP with Stochastic Demands
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Energy Minimizing Vehicle Routing Problem
- Bounds and Heuristics for Capacitated Routing Problems
- Capacitated arc routing problems
- Capacitated Vehicle Routing on Trees
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Cumulative Vehicle Routing Problem: A Column Generation Approach
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Improved approximation algorithms for cumulative VRP with stochastic demands
