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

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

Maria Eugénia Captivo

Publication date: 25 June 1992

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

zbMATH Keywords

\(p\)-median; dual heuristic procedure; greedy-type heuristic

Mathematics Subject Classification ID

90B80: Discrete location and assignment

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

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

Uses Software

• Algorithm 97

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item