Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
From MaRDI portal
Publication:1296008
DOI10.1016/S0377-2217(97)00201-4zbMath0943.90057MaRDI QIDQ1296008
Publication date: 13 September 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (13)
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ New complexity results for the \(p\)-hub median problem ⋮ An efficient heuristic for the expansion problem of cellular wireless networks ⋮ The \(p\)-hub center allocation problem ⋮ The single allocation problem in the interacting three-hub network ⋮ Allocation strategies in hub networks ⋮ Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU ⋮ Steiner diagrams and \(k\)-star hubs ⋮ Hub location-allocation in intermodal logistic networks ⋮ Network hub location problems: The state of the art ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs
Uses Software
Cites Work
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- A linear program for the two-hub location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Hub network design with single and multiple allocation: A computational study
- Hub Location and the p-Hub Median Problem
- Lower Bounds for the Hub Location Problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
This page was built for publication: Efficient solution procedure and reduced size formulations for \(p\)-hub location problems