✦ LIBER ✦

An improved parallel algorithm for 0/1 knapsack problem

✍ Scribed by Gen-Huey Chen; Jin-Hwang Jang

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 870 KB
Volume: 18
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(92)90047-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for 0-1 multiple-knapsack p

An algorithm for 0-1 multiple-knapsack problems

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

An expanding-core algorithm for the exac

An expanding-core algorithm for the exact 0–1 knapsack problem

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 747 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

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

Fast and Scalable Parallel Algorithms fo

Fast and Scalable Parallel Algorithms for Knapsack-like Problems

✍ Afonso Ferreira; John Michael Robson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 403 KB

We present two new algorithms for searching in sorted X ؉ Y ؉ R ؉ S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 log n) (n being the size of the sorted arrays X, Y, R, and S). Hence in each case, by constructing arrays of size n ‫؍‬ O(2 s/4 ), we obtain a

An optimization algorithm for a penalize

An optimization algorithm for a penalized knapsack problem

✍ Alberto Ceselli; Giovanni Righini 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 217 KB