Locating Depots for Capacitated Vehicle Routing
DOI10.1007/978-3-642-22935-0_20zbMath1343.90047DBLPconf/approx/GortzN11OpenAlexW1750879921WikidataQ60554442 ScholiaQ60554442MaRDI QIDQ3088097
Inge Li Gørtz, Viswanath Nagarajan
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/133597
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (1)
Uses Software
Cites Work
- Location-routing: issues, models and methods
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Combined location-routing problems: A synthesis and future research directions
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A constant-factor approximation algorithm for the \(k\)-median problem
- The Vehicle Routing Problem
- Locating Depots for Capacitated Vehicle Routing
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Bounds and Heuristics for Capacitated Routing Problems
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- Facility Location with Matroid or Knapsack Constraints
This page was built for publication: Locating Depots for Capacitated Vehicle Routing
