Capacitated Vehicle Routing on Trees
From MaRDI portal
Publication:3980515
DOI10.1287/OPRE.39.4.616zbMath0736.90029OpenAlexW2104166288MaRDI QIDQ3980515
Gilbert Laporte, Hélène Mercure, Martine Labbé
Publication date: 26 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.4.616
lower boundsNP-hardbin packingtotal distance traveledworst case performancefleet of vehicleslinear time heuristiccapacitated vehicle routing problem on trees
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (40)
A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering ⋮ Approximation algorithms for distance constrained vehicle routing problems ⋮ An analysis of lower bound procedures for the bin packing problem ⋮ The split delivery vehicle scheduling problem with time windows and grid network distances ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Computing the asymptotic worst-case of bin packing lower bounds ⋮ BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem ⋮ An approximation algorithm for the pickup and delivery vehicle routing problem on trees ⋮ Routing problems: A bibliography ⋮ Improved approximations for capacitated vehicle routing with unsplittable client demands ⋮ New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation ⋮ A three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ Balancing profits and costs on trees ⋮ The school bus problem on trees ⋮ New bin packing fast lower bounds ⋮ Improved approximation algorithms for cumulative VRP with stochastic demands ⋮ A new destructive bounding scheme for the bin packing problem ⋮ An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing ⋮ Modeling and Solving the Capacitated Vehicle Routing Problem on Trees ⋮ Branch-and-bound algorithms for the multi-product assembly line balancing problem ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ Bounds for the cardinality constrained \(P \|C_{max}\) problem ⋮ On the approximation of the generalized capacitated tree-routing problem ⋮ Bin packing problem with conflicts and item fragmentation ⋮ Approximation Algorithms for Cumulative VRP with Stochastic Demands ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Exploiting sparsity in pricing routines for the capacitated arc routing problem ⋮ The preemptive swapping problem on a tree ⋮ Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand ⋮ Capacitated vehicle routing problem on line with unsplittable demands ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ Packing-based branch-and-bound for discrete malleable task scheduling ⋮ A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line ⋮ A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
This page was built for publication: Capacitated Vehicle Routing on Trees
