✦ LIBER ✦

A new directed branching heuristic for the pq-median problem

✍ Scribed by M Alminyana; F Borrás; J.T Pastor

Book ID: 119579062
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 463 KB
Volume: 6
Category: Article
ISSN: 0966-8349
DOI: 10.1016/s0966-8349(98)00063-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Heuristic Approach for the P-Media

A New Heuristic Approach for the P-Median Problem

✍ Z. Dai and T-Y. Cheung 📂 Article 📅 1997 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 408 KB

New heuristic algorithms for solving the

New heuristic algorithms for solving the planar p-median problem

✍ Drezner, Zvi; Brimberg, Jack; Mladenović, Nenad; Salhi, Said 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 557 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 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

A Lagrangean heuristic for the pk-median

A Lagrangean heuristic for the pk-median dynamic location problem

✍ Roberto Diéguez Galvão; Ernesto del R. Santibañez-Gonzalez 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 617 KB

A branch-and-cut method for the obnoxiou

A branch-and-cut method for the obnoxiousp-median problem

✍ Pietro Belotti; Martine Labbé; Francesco Maffioli; Malick M. Ndiaye 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 286 KB