✦ LIBER ✦

Analysis of centroid aggregation for the Euclidean distance p-median problem

✍ Scribed by Peiwu Zhao; Rajan Batta

Book ID: 108445407
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 467 KB
Volume: 113
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(98)00010-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis of demand point aggr

Worst-case analysis of demand point aggregation for the Euclidean p-median problem

✍ Lian Qi; Zuo-Jun Max Shen 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 676 KB

An Efficient Algorithm for the p-Median

An Efficient Algorithm for the p-Median Problem With Maximum Distance Constraints

✍ Basheer M. Khumawala 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 502 KB

Algorithm for the p-Median Problem with

Algorithm for the p-Median Problem with Maximum Distance Constraints: Extension and Reply

✍ Basheer M. Khumawala 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

Design and analysis of hybrid metaheuris

Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem

✍ Javier Alcaraz; Mercedes Landete; Juan F. Monge 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Parallelization of the scatter search fo

Parallelization of the scatter search for the p-median problem

✍ Félix Garcı́a-López; Belén Melián-Batista; José A Moreno-Pérez; J Marcos Moreno- 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 207 KB

This article develops several strategies for the parallelization of the metaheuristic called scatter search, which is a population-based method that constructs solutions by combining others. Three types of parallelization have been proposed to achieve either an increase of efficiency or an increase

Results of a New Approach to Solving the

Results of a New Approach to Solving the p-Median Problem with Maximum Distance Constraints

✍ Richard L. Church; Michael E. Meadows 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 612 KB