✦ LIBER ✦

The many-commodity location problem (the branch-and-bound method)

✍ Scribed by I. M. Davydova; I. V. Romanovskii

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Branch-and-Cut method for the Capacita

✍ José-Manuel Belenguer; Enrique Benavent; Christian Prins; Caroline Prodhon; Robe 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 296 KB

A branch-and-bound algorithm for the mul

✍ Dong-wan Tcha; Bum-il Lee 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 518 KB

A set-covering problem: the combinatoria

✍ Yu.A. Zuev 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 890 KB

Branch-and-Bound Strategies for the Log

✍ Paul M. Bobrowski 📂 Article 📅 1990 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 567 KB

Realization of the branch and bound meth

✍ M.D. Ivanchev; I.G. Mitev; N.I. Yanev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 478 KB

A branch-and-bound algorithm for the qua

✍ Peter Hahn; Thomas Grant; Nat Hall 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 927 KB