✦ LIBER ✦

A bicriterion call center problem through an evolved branch and bound algorithm

✍ Scribed by Satya Prakash; Renu Tuli; Peeyush Pant; Leena Singh; Anil Kumar Agrawal; Anuj Gupta

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An enhanced branch-and-bound algorithm f

✍ Michael J. Brusco 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

An upper bound for the zero-one knapsack

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 831 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

Branch-and-Bound Variant of an Outcome-B

✍ J. Fülöp; L. D. Muu 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 118 KB