Locating depots for capacitated vehicle routing
DOI10.1007/978-3-642-22935-0_20zbMATH Open1343.90047DBLPconf/approx/GortzN11OpenAlexW1750879921WikidataQ60554442 ScholiaQ60554442MaRDI QIDQ3088097FDOQ3088097
Authors: 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
Recommendations
- Locating depots for capacitated vehicle routing
- Primal-dual schema and Lagrangian relaxation for the \(k\)-location-routing problem
- Minimizing latency of capacitated \(k\)-tours
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Algorithms and Data Structures
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Combined location-routing problems: A synthesis and future research directions
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The vehicle routing problem
- Location-routing: issues, models and methods
- Bounds and Heuristics for Capacitated Routing Problems
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Local Search Heuristics for k-Median and Facility Location Problems
- A constant-factor approximation algorithm for the \(k\)-median problem
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Facility Location with Matroid or Knapsack Constraints
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Locating depots for capacitated vehicle routing
Cited In (10)
- Airports and railways: facility location meets network design
- Title not available (Why is that?)
- Title not available (Why is that?)
- The effect of ignoring routes when locating depots
- Approximation results for a min-max location-routing problem
- Allocation of Resources to Depots
- Locating depots for capacitated vehicle routing
- Primal-dual schema and Lagrangian relaxation for the \(k\)-location-routing problem
- Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles
- Locating depots for capacitated vehicle routing
Uses Software
This page was built for publication: Locating depots for capacitated vehicle routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088097)
