A clustering approach to the planar hub location problem

DOI10.1007/BF02060486zbMath0782.90063OpenAlexW2125814700MaRDI QIDQ689257

M. C. Fu

Publication date: 28 February 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02060486

zbMATH Keywords

cluster meansplanar hub location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

On tabu search for the location of interacting hub facilities, New complexity results for the \(p\)-hub median problem, Extensions to the Weber problem, A genetic algorithm for the uncapacitated single allocation planar hub location problem, An exact solution procedure for a cluster hub location problem, Location and layout planning. A survey, Graph clustering, The planar hub location problem: a probabilistic clustering approach, Network hub location problems: The state of the art, A hybrid genetic/optimization algorithm for a task allocation problem, Integer programming formulations of discrete hub location problems, The \(K\)-connection location problem in a plane

Uses Software

• IMSL Numerical Libraries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Cluster Analysis: An Application of Lagrangian Relaxation
• The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
• On the Location of Hub Facilities
• Location-Allocation Problems
• Integer Programming and the Theory of Grouping
• Cluster Analysis and Mathematical Programming