A new heuristic approach for the P-median problem

DOI10.1057/PALGRAVE.JORS.2600443zbMATH Open0892.90118OpenAlexW2058701806MaRDI QIDQ4359928FDOQ4359928

Authors:

Publication date: 20 October 1997

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600443

Recommendations

• A new heuristic for solving the \(p\)-median problem in the plane
• A hybrid heuristic for the \(p\)-median problem
• New heuristic algorithms for solving the planar \(p\)-median problem
• A dynamic programming heuristic for the \(P\)-median problem
• A gamma heuristic for the \(p\)-median problem
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint
• A computational study for the \(p\)-median problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem

zbMATH Keywords

heuristiclocation-allocationEuclidean \(p\)-median problemlevel-\(m\) optimumpublic service centres

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cited In (27)

• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Sequential zone adjustment for approximate solving of large p-median problems
• A computational study for the \(p\)-median problem
• On solving unreliable planar location problems
• The \(p\)-median problem: a survey of metaheuristic approaches
• A new heuristic for solving the \(p\)-median problem in the plane
• Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
• Fast primal and dual heuristics for the \(p\)-median location problem
• A hybrid heuristic for the \(p\)-median problem
• Title not available (Why is that?)
• A Lagrangian search method for the \(P\)-median problem
• An alternating heuristic for medianoid and centroid problems in the plane
• New heuristic algorithms for solving the planar \(p\)-median problem
• A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights
• P-median problems with an additional constraint on the assignment variables
• Title not available (Why is that?)
• A heuristic for large-size \(p\)-median location problems with application to school location
• A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
• An effective heuristic for the \(P\)-median problem with application to ambulance location
• An aggregation heuristic for large scale p-median problem
• Improved starting solutions for the planar \(p\)-median problem
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint
• Large neighborhood local search for the \(p\)-median problem
• On the conditional \(p\)-median problem
• A dynamic programming heuristic for the \(P\)-median problem
• A new formulation for the conditional \(p\)-median and \(p\)-center problems

This page was built for publication: A new heuristic approach for the P-median problem

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