✦ LIBER ✦

A General Algorithm for One-Dimensional Knapsack Problems

✍ Scribed by Giorgio P. Ingargiola and James F. Korsh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the Martello-Toth algorithm fo

✍ Leena Aittoniemi; Klaus Oehlandt 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 184 KB

A surrogate relaxation based algorithm f

✍ Mohamed Djerdjour; Kamlesh Mathur; Harvey M. Salkin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Approximate algorithms for some generali

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

An efficient algorithm for multi-dimensi

✍ Juan Chen; Xiao-ling Sun; Hui-juan Guo 📂 Article 📅 2006 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 428 KB

Greedy algorithm for the general multidi

✍ Yalçın Akçay; Haijun Li; Susan H. Xu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 328 KB

A new algorithm for one-dimensional prob

✍ C.K. Au 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 296 KB