The single allocation problem in the interacting three-hub network

DOI<17::AID-NET2>3.0.CO;2-N 10.1002/(SICI)1097-0037(200001)35:1<17::AID-NET2>3.0.CO;2-NzbMath0938.90070OpenAlexW2047031742MaRDI QIDQ4944738

Jinhyeon Sohn, Sungsoo Park

Publication date: 27 June 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200001)35:1<17::aid-net2>3.0.co;2-n

zbMATH Keywords

NP-hardmixed integer formulationsingle allocation problemthree-hub network

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

A conditional \(p\)-hub location problem with attraction functions ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Improved hardness and approximation results for single allocation hub location problems ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Approximation algorithms for median hub location problems ⋮ A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case ⋮ An improved algorithm for fixed-hub single allocation problems ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ Network hub location problems: The state of the art ⋮ Adapting polyhedral properties from facility to hub location problems ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Improved hardness and approximation results for single allocation hub location ⋮ Optimal Airline Networks, Flight Volumes, and the Number of Crafts for New Low-Cost Carrier in Japan ⋮ Efficient algorithms for a simple network design problem ⋮ A study of the quadratic semi-assignment polytope ⋮ Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs ⋮ Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• 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
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
• Integer programming formulations of discrete hub location problems
• On tabu search for the location of interacting hub facilities
• Designing satellite communication networks by zero—one quadratic programming
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Hub network design with single and multiple allocation: A computational study
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Neural versus traditional approaches to the location of interacting hub facilities
• The Complexity of Multiterminal Cuts
• Hub Location and the p-Hub Median Problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System