Lower Bounds for the Hub Location Problem
From MaRDI portal
Publication:4859339
DOI10.1287/mnsc.41.4.713zbMath0836.90109MaRDI QIDQ4859339
Morton E. O'Kelly, Jadranka Skorin-Kapov, Darko Skorin-Kapov
Publication date: 7 January 1996
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.41.4.713
Related Items
Dual-based approach for a hub network design problem under non-restrictive policy, HubLocator: An exact solution method for the multiple allocation hub location problem, Solving the uncapacitated hub location problem using genetic algorithms, Benders decomposition for the uncapacitated multiple allocation hub location problem, Tight linear programming relaxations of uncapacitated \(p\)-hub median problems, Design of a distributed finer transport network with hubbing topology, Efficient solution procedure and reduced size formulations for \(p\)-hub location problems, Solving large single allocation \(p\)-hub problems with two or three hubs, Hub-and-spoke network design with congestion, A cost allocation problem arising in hub-spoke network systems, Network hub location problems: The state of the art