A heuristic for large-size \(p\)-median location problems with application to school location

DOI10.1007/BF02085654zbMath0812.90096OpenAlexW2041454153MaRDI QIDQ1339149

Nelio Domingues Pizzolato

Publication date: 15 May 1995

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

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

zbMATH Keywords

heuristiclocation\(p\)-medianlarge weighted graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items

Sustainable operations ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ Siting of HIV/AIDS diagnostic equipment in South Africa: a case study in locational analysis ⋮ The Location of Public Schools: Evaluation of Practical Experiences ⋮ Optimizing location and size of rural schools in Chile

Cites Work

• A method for solving to optimality uncapacitated location problems
• A note on solving large p-median problems
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• An Overview of Representative Problems in Location Research
• A Dual-Bounded Algorithm for the p-Median Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• A man-machine approach toward solving the traveling salesman problem