𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristic solution of the multisource Weber problem as a p-median problem

✍ Scribed by Pierre Hansen; Nenad Mladenović; Éric Taillard

Book ID
108410535
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
96 KB
Volume
22
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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