✦ LIBER ✦

Approximation for knapsack problems with multiple constraints

✍ Scribed by Li’ang Zhang; Yin Zhang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The knapsack problem with disjoint multi

✍ Vijay Aggarwal; Narsingh Deo; Dilip Sarkar 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 750 KB

The 0–1 knapsack problem with multiple c

✍ Robert M. Nauss 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 787 KB

A nonlinear minimax allocation problem w

✍ Hanan Luss 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Knapsack problem with probability constr

✍ Alexei A. Gaivoronski; Abdel Lisser; Rafael Lopez; Hu Xu 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 190 KB

A successive approximation algorithm for

✍ Zhenbo Wang; Wenxun Xing 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 420 KB

Approximate algorithms for some generali

✍ Ashok K. Chandra; D.S. Hirschberg; C.K. Wong 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 361 KB