A result on projection for the vehicle routing problem
From MaRDI portal
Publication:1127162
DOI10.1016/0377-2217(94)00025-8zbMath0912.90118OpenAlexW2044280739MaRDI QIDQ1127162
Publication date: 13 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00025-8
Related Items (35)
Stronger multi-commodity flow formulations of the capacitated vehicle routing problem ⋮ The traveling salesman problem with time-dependent service times ⋮ A branch-and-cut framework for the consistent traveling salesman problem ⋮ Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem ⋮ New techniques for cost sharing in combinatorial optimization games ⋮ Comparison of formulations for the inventory routing problem ⋮ Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route ⋮ A symmetry-free polynomial formulation of the capacitated vehicle routing problem ⋮ A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection ⋮ The shared customer collaboration vehicle routing problem ⋮ A matheuristic for the asymmetric capacitated vehicle routing problem ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups ⋮ Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ Recent advances in vehicle routing exact algorithms ⋮ Polynomial-time separation of enhanced reverse multistar inequalities ⋮ New exact solution approaches for the split delivery vehicle routing problem ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time ⋮ A comparative analysis of several asymmetric traveling salesman problem formulations ⋮ Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ Unnamed Item ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading ⋮ The multi-vehicle probabilistic covering tour problem ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ A computational comparison of flow formulations for the capacitated location-routing problem ⋮ The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints ⋮ Exploiting sparsity in pricing routines for the capacitated arc routing problem ⋮ Projection results for vehicle routing ⋮ Generalized relax-and-fix heuristic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral study of the capacitated vehicle routing problem
- Polyhedral results for a vehicle routing problem
- Using separation algorithms to generate mixed integer model reformulations
- Dioïds and semirings: Links to fuzzy sets and other applications
- Optimal Routing under Capacity and Distance Restrictions
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Parallel Savings Based Heuristics for the Delivery Problem
- Implementing vehicle routing algorithms
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
This page was built for publication: A result on projection for the vehicle routing problem
