✦ LIBER ✦

On the Weber facility location problem with limited distances and side constraints

✍ Scribed by Isaac F. Fernandes, Daniel Aloise, Dario J. Aloise, Pierre Hansen…

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the two

✍ Hyung-bong Ro; Dong-wan Tcha 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 554 KB

A Branch and Bound Algorithm for An Unca

✍ A. Klose 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 855 KB

A branch and bound algorithm for an unca

✍ Andreas Klose 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB

VRP12 (vehicle routing problem with dist

✍ Ceranoglu, Ahmet N.; Duman, Ekrem 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 398 KB

On the structure of the solution set for

✍ Justo Puerto; Antonio M. Rodríguez-Chía 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 426 KB

THE MAXIMAL COVERING LOCATION PROBLEM WI

✍ Abraham Mehrez; Alan Stulman 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB