An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
From MaRDI portal
Publication:2784108
DOI10.1287/mnsc.44.12.S235zbMath0989.90537WikidataQ58615065 ScholiaQ58615065MaRDI QIDQ2784108
Hasan Pirkul, David A. Schilling
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (17)
A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ A cost allocation problem arising in hub-spoke network systems ⋮ A branch‐and‐cut algorithm for hub network design problems with profits ⋮ Machine learning augmented approaches for hub location problems ⋮ Allocation strategies in hub networks ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Exact solution of hub network design problems with profits ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ Network hub location problems: The state of the art ⋮ Hub-and-spoke network design with congestion ⋮ Alternate solution approaches for competitive hub location problems ⋮ Perspectives on modeling hub location problems ⋮ New formulations and solution procedures for the hop constrained network design problem. ⋮ Lagrangean relaxation for the capacitated hub location problem with single assignment ⋮ Competition in a deregulated air transportation market
This page was built for publication: An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
