Efficient solution procedure and reduced size formulations for p-hub location problems

DOI10.1016/S0377-2217(97)00201-4MaRDI QIDQ1296008zbMATH OpenFDO

Authors Jinhyeon Sohn, Sungsoo Park

Publication date 13 September 2000

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

Full work available at URL https://doi.org/10.1016/S0377-2217(97)00201-4

zbMATH Keywords

hub locationmixed integer programmingmultiple allocationshortest pathsingle allocation

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11)

Recommendations

• Solving large single allocation p-hub problems with two or three hubs
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Uncapacitated single and multiple allocation \(p\)-hub center problems

Cites work

• A linear program for the two-hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Avoiding local optima in the p-hub location problem using tabu search and GRASP
• Heuristics for the p-hub location problem
• Hub Location and the p-Hub Median Problem
• Hub network design with single and multiple allocation: A computational study
• Integer programming formulations of discrete hub location problems
• Lower Bounds for the Hub Location Problem
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• On tabu search for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(16)

• Solving large single allocation p-hub problems with two or three hubs
• Enumeration and search procedures for a hub location problem with economies of scale
• An efficient heuristic for the expansion problem of cellular wireless networks
• Steiner diagrams and \(k\)-star hubs
• Network hub location problems: The state of the art
• Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Allocation strategies in hub networks
• The single allocation problem in the interacting three-hub network
• Solving the uncapacitated single allocation p-hub Median problem on GPU
• Hub location-allocation in intermodal logistic networks
• HubLocator: An exact solution method for the multiple allocation hub location problem
• New complexity results for the \(p\)-hub median problem
• The \(p\)-hub center allocation problem
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Efficient solution procedure and reduced size formulations for \(p\)-hub location problems

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