The p-median problem: A survey of metaheuristic approaches

DC Field	Value	Language
dc.contributor.author	Mladenović, Nenad	en
dc.contributor.author	Brimberg, Jack	en
dc.contributor.author	Hansen, Pierre	en
dc.contributor.author	Moreno-Pérez, José	en
dc.date.accessioned	2020-05-02T16:42:12Z	-
dc.date.available	2020-05-02T16:42:12Z	-
dc.date.issued	2007-06-16	en
dc.identifier.issn	0377-2217	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/2530	-
dc.description.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.	en
dc.publisher	Elsevier	-
dc.relation.ispartof	European Journal of Operational Research	en
dc.subject	Location \| Metaheuristics \| p-Median	en
dc.title	The p-median problem: A survey of metaheuristic approaches	en
dc.type	Article	en
dc.identifier.doi	10.1016/j.ejor.2005.05.034	en
dc.identifier.scopus	2-s2.0-33846003172	en
dc.relation.firstpage	927	en
dc.relation.lastpage	939	en
dc.relation.issue	3	en
dc.relation.volume	179	en
dc.description.rank	M21	-
item.fulltext	No Fulltext	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.grantfulltext	none	-
crisitem.author.orcid	0000-0001-6655-0409	-

370

checked on Jun 11, 2026

140

checked on Jun 15, 2026

Check