Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem

DOI10.1007/978-3-642-22935-0_9zbMath1343.68309OpenAlexW1765900978MaRDI QIDQ3088086

David B. Shmoys, Tim Carnes

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: https://doi.org/10.1007/978-3-642-22935-0_9

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (3)

A survey of recent research on location-routing problems ⋮ Improved algorithms for joint optimization of facility locations and network connections ⋮ An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem

Cites Work

• An exact algorithm for minimizing routing and operating costs in depot location
• Hamiltonian location problems
• Combined location-routing problems: A synthesis and future research directions
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Generalized Subtour Elimination Constraints and Connectivity Constraints
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• A General Approximation Technique for Constrained Forest Problems

This page was built for publication: Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem