Heuristic methods for thep-center problem

DOI10.1051/RO/1991250100651MaRDI QIDQ3359995zbMATH OpenOpenAlexFDO

Authors B. Pelegrin

Publication date 1991

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105003

zbMATH Keywords

2-approximationcluster analysisheuristicp-center problem

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Continuous location (90B85)

Recommendations

• A simple heuristic for the p-centre problem
• The p-Centre Problem-Heuristic and Optimal Algorithms
• The \(p\)-median problem: a survey of metaheuristic approaches
• A heuristic for the p-center problem in graphs
• New heuristic algorithms for the rectangular p-cover problem

Cited in

(11)

• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
• Dominant, an algorithm for the \(p\)-center problem.
• Heuristics of the Cocks-Pinch method
• The 1-center problem in the plane with independent random weights
• Heuristics for multiple facility location in a network using the variance criterion
• A Best Possible Heuristic for the k-Center Problem
• Solving the continuous space p-centre problem: planning application issues
• Bee colony optimization for the \(p\)-center problem
• The obnoxious facilities p-center problem with forbidden regions
• A VNS method for the conditional p-next center problem
• A simple heuristic for the p-centre problem

This page was built for publication: Heuristic methods for thep-center problem

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