Publication:4944738

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.90070MaRDI QIDQ4944738

Sungsoo Park, Jinhyeon Sohn

Publication date: 27 June 2000

zbMATH Keywords

NP-hard; mixed integer formulation; single allocation problem; three-hub network

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C60: Abstract computational complexity for mathematical programming problems

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Related Items

HubLocator: An exact solution method for the multiple allocation hub location problem, Adapting polyhedral properties from facility to hub location problems, A conditional \(p\)-hub location problem with attraction functions, 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, Network hub location problems: The state of the art, 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