✦ LIBER ✦

Bounds for nested knapsack problems

✍ Scribed by Robert E. Johnston; Lutfar R. Khan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Time Algorithms for Knapsack Prob

✍ David Pisinger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A Bound and Bound algorithm for the zero

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 791 KB

The knapsack problem with generalized up

✍ Salah E. Elmaghraby 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 929 KB

A branch-and-bound algorithm for hard mu

✍ Alex S. Fukunaga 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 683 KB

Tight complexity bounds for the two-dime

✍ Valentin E. Brimkov; Stefan S. Dantchev; Mauro Leoncini 📂 Article 📅 1999 🏛 Springer Milan 🌐 English ⚖ 43 KB

New pseudopolynomial complexity bounds f

✍ Arie Tamir 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 688 KB