✦ LIBER ✦

An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem

✍ Scribed by Stefano Benati

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for the mul

✍ Dong-wan Tcha; Bum-il Lee 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 518 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

An improved approximation algorithm for

✍ Guang Xu; Jinhui Xu 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 317 KB

An Improved Lower Bound for the Multimed

✍ Ranganath Nuggehalli; Timothy J. Lowe; James E. Ward 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 113 KB

The many-commodity location problem (the

✍ I. M. Davydova; I. V. Romanovskii 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 415 KB