A linear program for the two-hub location problem

DOI10.1016/S0377-2217(96)00233-0zbMath0921.90108MaRDI QIDQ1278146

Sungsoo Park, Jinhyeon Sohn

Publication date: 18 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

minimum cutpolynomial timesingle allocationdiscrete two-hub location problemquadratic 0--1 integer program

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (21)

New complexity results for the \(p\)-hub median problem ⋮ 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 ⋮ The single allocation problem in the interacting three-hub network ⋮ A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case ⋮ Allocation strategies in hub networks ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ Network hub location problems: The state of the art ⋮ Dual-based approach for a hub network design problem under non-restrictive policy ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ Adapting polyhedral properties from facility to hub location problems ⋮ A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand ⋮ Unmanned aerial vehicle hub-location and routing for monitoring geographic borders ⋮ 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 ⋮ Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems ⋮ Efficient solution procedure and reduced size formulations for \(p\)-hub location problems ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs

Cites Work

• Unnamed Item
• 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
• 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
• On the Location of Hub Facilities
• Designing satellite communication networks by zero—one quadratic programming
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System

This page was built for publication: A linear program for the two-hub location problem