Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem
From MaRDI portal
Publication:2820103
DOI10.1007/978-1-4614-8588-9_1zbMath1344.90006OpenAlexW93935878MaRDI QIDQ2820103
Anton Kocheturov, Mikhail Batsyn, Boris I. Goldengorin, Panos M. Pardalos
Publication date: 13 September 2016
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8588-9_1
Related Items
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles
Uses Software
Cites Work
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- Advances in sensitivity analysis and parametric programming
- Lower tolerance-based branch and bound algorithms for the ATSP
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Tolerance-based branch and bound algorithms for the ATSP
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- An addendum on: ``Sensitivity analysis of the optimal assignment
- The Vehicle Routing Problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
