A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
From MaRDI portal
Publication:2688881
DOI10.1007/s10288-021-00498-7OpenAlexW3215730597MaRDI QIDQ2688881
Eduardo Uchoa, João Marcos Pereira Silva, Caio Marinho Damião
Publication date: 6 March 2023
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-021-00498-7
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- A branch and bound algorithm for the capacitated vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A branch-and-price algorithm for the minimum latency problem
- Limited memory rank-1 cuts for vehicle routing problems
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- The time dependent traveling salesman problem: polyhedra and algorithm
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
- A generic exact solver for vehicle routing and related problems
- The cumulative capacitated vehicle routing problem with profits under uncertainty
- A generic exact solver for Vehicle Routing and related problems
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Improved branch-cut-and-price for capacitated vehicle routing
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem
- The minimum latency problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Time‐dependent traveling salesman problem–the deliveryman case
- Shortest Path Problems with Resource Constraints
- JuMP: A Modeling Language for Mathematical Optimization
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
This page was built for publication: A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
