A result on projection for the vehicle routing problem
From MaRDI portal
Publication:1127162
Recommendations
Cites work
- scientific article; zbMATH DE number 3648431 (Why is no real title available?)
- scientific article; zbMATH DE number 3912104 (Why is no real title available?)
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3892967 (Why is no real title available?)
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Dioïds and semirings: Links to fuzzy sets and other applications
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Implementing vehicle routing algorithms
- Optimal Routing under Capacity and Distance Restrictions
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Parallel Savings Based Heuristics for the Delivery Problem
- Polyhedral results for a vehicle routing problem
- Polyhedral study of the capacitated vehicle routing problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Using separation algorithms to generate mixed integer model reformulations
Cited in
(36)- Exact algorithms for routing problems under vehicle capacity constraints
- New techniques for cost sharing in combinatorial optimization games
- Recent advances in vehicle routing exact algorithms
- The family capacitated vehicle routing problem
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem
- A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Polynomial-time separation of enhanced reverse multistar inequalities
- Combined route capacity and route length models for unit demand vehicle routing problems
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
- Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game
- Generalized relax-and-fix heuristic
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Comparison of formulations for the inventory routing problem
- A matheuristic for the asymmetric capacitated vehicle routing problem
- The multi-vehicle probabilistic covering tour problem
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- New exact solution approaches for the split delivery vehicle routing problem
- The shared customer collaboration vehicle routing problem
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
- A branch-and-cut framework for the consistent traveling salesman problem
- The traveling salesman problem with time-dependent service times
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Projection results for vehicle routing
- A computational comparison of flow formulations for the capacitated location-routing problem
- On the vehicle routing problem with lower bound capacities
This page was built for publication: A result on projection for the vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127162)
