Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
From MaRDI portal
Publication:3439976
DOI10.1007/978-0-387-48793-9_9zbMath1278.90216OpenAlexW195910675MaRDI QIDQ3439976
Publication date: 21 May 2007
Published in: Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-48793-9_9
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (7)
Distribution network design on the battlefield ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study ⋮ Planning a capacitated road network with flexible travel times: a genetic algorithm ⋮ A survey of the standard location-routing problem ⋮ Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
Uses Software
This page was built for publication: Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
