A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations
From MaRDI portal
(Redirected from Publication:1908292)
Recommendations
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
- scientific article; zbMATH DE number 1452992
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A new subtour elimination constraint for the vehicle routing problem
Cites work
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An efficient algorithm for K shortest simple paths
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- Optimal Routing under Capacity and Distance Restrictions
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Parallel iterative search methods for vehicle routing problems
- State-space relaxation procedures for the computation of bounds to routing problems
- Validation of subgradient optimization
Cited in
(23)- An algorithm for the capacitated vehicle routing problem with route balancing
- A new subtour elimination constraint for the vehicle routing problem
- Route relaxations on GPU for vehicle routing problems
- Stronger K-tree relaxations for the vehicle routing problem
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Lower bounds from state space relaxations for concave cost network flow problems
- Implicit depot assignments and rotations in vehicle routing heuristics
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- An integer linear programming local search for capacitated vehicle routing problems
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- scientific article; zbMATH DE number 1766758 (Why is no real title available?)
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
- A new method for solving capacitated location problems based on a set partitioning approach
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A metaheuristic for stochastic service network design
- A memory-enhanced greedy randomized adaptive search procedure for the multi-pickup and delivery problem with time windows
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A dual ascent procedure for the set partitioning problem
This page was built for publication: A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908292)
