✦ LIBER ✦

Density Based Problem Space Search for the Capacitated Clusteringp-Median Problem

✍ Scribed by Samad Ahmadi; Ibrahim H. Osman

Book ID: 111570892
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 229 KB
Volume: 131
Category: Article
ISSN: 0254-5330
DOI: 10.1023/b:anor.0000039511.61195.21

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hybrid scatter search and path relinking

Hybrid scatter search and path relinking for the capacitated p-median problem

✍ Juan A. Díaz; Elena Fernández 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Two exact algorithms for the capacitated

Two exact algorithms for the capacitated p-median problem

✍ Alberto Ceselli 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 165 KB

Kernel search for the capacitated facili

Kernel search for the capacitated facility location problem

✍ G. Guastaroba, M. G. Speranza 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 1013 KB

An efficient heuristic algorithm for the

An efficient heuristic algorithm for the capacitated(p-!)median problem

✍ Yaghini, Masoud; Momeni, Mohsen; Sarmadi, Mohammadreza; Ahadi, Hamid Reza 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 458 KB

A hybrid metaheuristic approach for the

A hybrid metaheuristic approach for the capacitated p-median problem

✍ Yaghini, Masoud; Karimi, Mohammad; Rahbar, Mohadeseh 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 872 KB

A branch-and-price algorithm for the cap

A branch-and-price algorithm for the capacitated p-median problem

✍ Alberto Ceselli; Giovanni Righini 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We