Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483164 | European Journal of Operational Research | 2007 | 13 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Nenad Mladenović, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez,