Fast primal and dual heuristics for the \(p\)-median location problem

DOI10.1016/0377-2217(91)90336-TzbMath0738.90044OpenAlexW2011325983MaRDI QIDQ1176817

Maria Eugénia Captivo

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90336-t

zbMATH Keywords

\(p\)-mediandual heuristic proceduregreedy-type heuristic

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A decomposition approach for the \(p\)-median problem on disconnected graphs, The \(p\)-median problem: a survey of metaheuristic approaches, On the exact solution of large-scale simple plant location problems, Matheuristics: survey and synthesis, Budget constrained location problem with opening and closing of facilities., An ant colony algorithm for the pos/neg weighted \(p\)-median problem, On solving unreliable planar location problems, Lagrangean heuristics for location problems, Heuristics for Location Models, Using decomposition to improve greedy solutions of the optimal diversity management problem

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Dual-Based Procedure for Uncapacitated Facility Location
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• The Location of Emergency Service Facilities
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median