✦ LIBER ✦

A parallel algorithm for the 0–1 knapsack problem

✍ Scribed by W. Loots; T. H. C. Smith

Publisher: Springer
Year: 1992
Tongue: English
Weight: 626 KB
Volume: 21
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf01407836

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved parallel algorithm for 0/1 k

An improved parallel algorithm for 0/1 knapsack problem

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

A hypercube algorithm for the 0/1 Knapsa

A hypercube algorithm for the 0/1 Knapsack problem

✍ Jong Lee; Eugene Shragowitz; Sartaj Sahni 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 878 KB

An algorithm for the 0/1 Knapsack proble

An algorithm for the 0/1 Knapsack problem

✍ Marion Lauriere 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 375 KB

A parallel two-list algorithm for the kn

A parallel two-list algorithm for the knapsack problem

✍ Der-Chyuan Lou; Chin-Chen Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 695 KB

An n-element knapsack problem has 2" possible solutions to search over, so a task which can be accomplished in 2" trials if an exhaustive search is used. Due to the exponential time in solving the knapsack problem, the problem is considered to be very hard. In the past decade, much effort has been d

A fully polynomial approximation algorit

A fully polynomial approximation algorithm for the 0–1 knapsack problem

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 428 KB

An exact algorithm for the 0–1 collapsin

An exact algorithm for the 0–1 collapsing knapsack problem

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