Lower Bounds for the Hub Location Problem

DOI10.1287/MNSC.41.4.713MaRDI QIDQ4859339zbMATH OpenOpenAlexFDO

Authors Morton E. O'Kelly, Darko Skorin-Kapov, Jadranka 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

zbMATH Keywords

hub locationlower bound

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• Lower bounding procedures for the single allocation hub location problem
• Tight bounds from a path based formulation for the tree of hub location problem
• HubLocator: An exact solution method for the multiple allocation hub location problem
• A non-triangular hub location problem
• Exact and heuristic approaches for the cycle hub location problem

Cited in

(26)

• 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
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
• An improved algorithm for fixed-hub single allocation problems
• Hub-and-spoke network design with congestion
• An improved lower bound for the multimedian location problem
• A cost allocation problem arising in hub-spoke network systems
• Multi-period hub set covering problems with flexible radius: a modified genetic solution
• Network hub location problems: The state of the art
• A Note on “The Latest Arrival Hub Location Problem”
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Lower bounding procedures for the single allocation hub location problem
• On the Quadratic Programming Approach for Hub Location Problems
• An M/M/c queue model for hub covering location problem
• Geometric rounding: A dependent randomized rounding scheme
• Allocation strategies in hub networks
• Hub Location and the p-Hub Median Problem
• 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
• Aggregation in hub location problems
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• Path relinking approach for multiple allocation hub maximal covering problem
• Routing traffic at hub facilities

This page was built for publication: Lower Bounds for the Hub Location Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859339)