Exact Algorithms for the Chance-Constrained Vehicle Routing Problem
From MaRDI portal
Publication:3186494
DOI10.1007/978-3-319-33461-5_8zbMath1419.90093OpenAlexW2493658341MaRDI QIDQ3186494
Ricardo Fukasawa, Thai Dinh, James R. Luedtke
Publication date: 10 August 2016
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-33461-5_8
Related Items
Uses Software
Cites Work
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- Stochastic vehicle routing: A comprehensive approach
- Models and exact solutions for a class of stochastic location-routing problems
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A unified exact method for solving different classes of vehicle routing problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- The Truck Dispatching Problem
- Stochastic Vehicle Routing Problem with Restocking
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Chance-Constrained Binary Packing Problems
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- The Vehicle Routing Problem with Stochastic Travel Times
- Vehicle routing with stochastic demands and restricted failures
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
- Shortest Path Problems with Resource Constraints
- A Vehicle Routing Problem with Stochastic Demand
