𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic for the p-center problems in graphs

✍ Scribed by J. Plesník

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
281 KB
Volume
17
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large-scale local search heuristics for
Large-scale local search heuristics for the capacitated vertex p-center problem
✍ Maria Paola Scaparra; Stefano Pallottino; Maria Grazia Scutellà 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

## Abstract This article investigates the application of very large neighborhood search techniques for solving the capacitated vertex __p__‐center problem. We characterize a local search neighborhood in terms of path and cyclic exchanges of customers among facilities, and exploit principles borrowe

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