✦ LIBER ✦

A better step-off algorithm for the knapsack problem

✍ Scribed by Harold Greenberg; Israel Feldman

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 515 KB
Volume: 2
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(80)90051-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A minimal algorithm for the multiple-cho

A minimal algorithm for the multiple-choice knapsack problem

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1017 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 dynamic programming algorithm for the

A dynamic programming algorithm for the bilevel knapsack problem

✍ Luce Brotcorne; Saïd Hanafi; Raïd Mansi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 940 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 deterministic algorithm for modular kn

A deterministic algorithm for modular knapsack problems

✍ Arto Salomaa 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 604 KB

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