✦ LIBER ✦

An algorithm for the 0/1 Knapsack problem

✍ Scribed by Marion Lauriere

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for the 0–1 collapsin

✍ Didier Fayard; Gérard Plateau 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 733 KB

An algorithm for the solution of the 0–1

✍ D. Fayard; G. Plateau 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 812 KB

An expanding-core algorithm for the exac

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 747 KB

An exact algorithm for the 0–1 linear kn

✍ Geng Lin; Wenxing Zhu; M. M. Ali 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 246 KB

An improved parallel algorithm for 0/1 k

✍ Gen-Huey Chen; Jin-Hwang Jang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 870 KB

An algorithm for 0-1 multiple-knapsack p

✍ Ming S. Hung; John C. Fisk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB