✦ LIBER ✦

A MORE EFFICIENT HEURISTIC FOR SOLVING LARGE P-MEDIAN PROBLEMS

✍ Scribed by Paul J. Densham; Gerard Rushton

Book ID: 110918709
Publisher: Springer
Year: 2005
Tongue: English
Weight: 602 KB
Volume: 71
Category: Article
ISSN: 1056-8190
DOI: 10.1111/j.1435-5597.1992.tb01849.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on solving large p-median problem

A note on solving large p-median problems

✍ J.E. Beasley 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 459 KB

Some heuristic methods for solving p-med

Some heuristic methods for solving p-median problems with a coverage constraint

✍ Jesús Sáez-Aguado; Paula Camelia Trandafir 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 288 KB

An aggregation heuristic for large scale

An aggregation heuristic for large scale p-median problem

✍ Pasquale Avella; Maurizio Boccia; Saverio Salerno; Igor Vasilyev 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 236 KB

A new heuristic for solving the p-median

A new heuristic for solving the p-median problem in the plane

✍ Brimberg, Jack; Drezner, Zvi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 254 KB

A heuristic for large-scale p-median ins

A heuristic for large-scale p-median instances

✍ Pasquale Avella; Antonio Sassano; Igor Vasil'ev 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 92 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