The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
From MaRDI portal
Publication:1991101
Recommendations
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Integer Programming and Combinatorial Optimization
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
Cites work
- A branch and bound algorithm for the capacitated vehicle routing problem
- A New Algorithm for the 0-1 Knapsack Problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A result on projection for the vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Combined route capacity and route length models for unit demand vehicle routing problems
- Decomposition Principle for Linear Programs
- Efficient elementary and restricted non-elementary route pricing
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- Improved branch-cut-and-price for capacitated vehicle routing
- Lagrangean relaxation. (With comments and rejoinder).
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- Multistars, partial multistars and the capacitated vehicle routing problem
- New benchmark instances for the capacitated vehicle routing problem
- On the complexity of the separation problem for rounded capacity inequalities
- Projection results for vehicle routing
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- The ellipsoid method and its consequences in combinatorial optimization
- The omnipresence of Lagrange
- The truck dispatching problem
- The vehicle routing problem. Latest advances and new challenges.
- The vehicle routing problem: An overview of exact and approximate algorithms
- Vehicle Routing
Cited in
(18)- The separation problem of rounded capacity inequalities: some polynomial cases
- Route relaxations on GPU for vehicle routing problems
- Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration
- The arc-item-load and related formulations for the cumulative vehicle routing problem
- A PTAS for bounded-capacity vehicle routing in planar graphs
- Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Bounds and Heuristics for Capacitated Routing Problems
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- scientific article; zbMATH DE number 6297716 (Why is no real title available?)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- Multi‐objective optimization of transporting blood products by routing UAVs: the case of Istanbul
- Improved approximation algorithms for the \(k\)-path partition problem
- An adaptive K-means and reinforcement learning (RL) algorithm to effective vaccine distribution
- An improved approximation algorithm for the minimum k-star partition problem
- Polyhedral study of the capacitated vehicle routing problem
- Methods for bi-objective routing and districting problems
This page was built for publication: The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991101)
