Lower Bounds for the Hub Location Problem
From MaRDI portal
Publication:4859339
DOI10.1287/mnsc.41.4.713zbMath0836.90109OpenAlexW2120951754MaRDI QIDQ4859339
Jadranka Skorin-Kapov, Darko Skorin-Kapov, Morton E. O'Kelly
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
A cost allocation problem arising in hub-spoke network systems ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ Geometric rounding: A dependent randomized rounding scheme ⋮ Allocation strategies in hub networks ⋮ An improved algorithm for fixed-hub single allocation problems ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Network hub location problems: The state of the art ⋮ Hub-and-spoke network design with congestion ⋮ Path relinking approach for multiple allocation hub maximal covering problem ⋮ Routing traffic at hub facilities ⋮ Dual-based approach for a hub network design problem under non-restrictive policy ⋮ Solving the uncapacitated hub location problem using genetic algorithms ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Multi-period hub set covering problems with flexible radius: a modified genetic solution ⋮ On the Quadratic Programming Approach for Hub Location Problems ⋮ 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
