Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 179, Issue 3, Pages 927-939Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2005.05.034
Keywords
metaheuristics; location; p-median
Ask authors/readers for more resources
The p-median problem is one of the basic models in discrete location theory. As with most location problems, it is classified as NP-hard, and so, heuristic methods are usually used to solve it. Metaheuristics are frameworks for building heuristics. In this survey, we examine the p-median, with the aim of providing an overview on advances in solving it using recent procedures based on metaheuristic rules. (c) 2006 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available