Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
From MaRDI portal
Publication:3439976
DOI10.1007/978-0-387-48793-9_9zbMath1278.90216MaRDI 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
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90B80: Discrete location and assignment
Related Items
A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Planning a capacitated road network with flexible travel times: a genetic algorithm, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, Distribution network design on the battlefield
Uses Software