✦ LIBER ✦

A Hybrid Heuristic for thep-Median Problem

✍ Scribed by Mauricio G.C. Resende; Renato F. Werneck

Book ID: 111584178
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 217 KB
Volume: 10
Category: Article
ISSN: 1381-1231
DOI: 10.1023/b:heur.0000019986.96257.50

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An effective heuristic for theP-median p

An effective heuristic for theP-median problem with application to ambulance location

✍ Michael Dzator, Janet Dzator 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 233 KB

A tighter formulation of thep-median pro

A tighter formulation of thep-median problem

✍ Sourour Elloumi 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 363 KB

An Efficient Genetic Algorithm for thep-

An Efficient Genetic Algorithm for thep-Median Problem

✍ Osman Alp; Erhan Erkut; Zvi Drezner 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 216 KB

Thep-facility ordered median problem on

Thep-facility ordered median problem on networks

✍ A. M. Rodríguez-Chía; J. Puerto; D. Pérez-Brito; J. A. Moreno 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 1018 KB

The Parallel Variable Neighborhood Searc

The Parallel Variable Neighborhood Search for thep-Median Problem

✍ Félix García-López; Belén Melián-Batista; José A. Moreno-Pérez; J. Marcos Moreno 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 89 KB

A dynamic programming heuristic for the

A dynamic programming heuristic for the P-median problem

✍ Michelle Hribar; Mark S. Daskin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 682 KB

A new heuristic algorithm is proposed for the P-median problem. The heuristic restricts the size of the state space of a dynamic programming algorithm. The approach may be viewed as an extension of the myopic or greedy adding algorithm for the P-median model. The approach allows planners to identify