✦ LIBER ✦

A dynamic programming method with lists for the knapsack sharing problem

✍ Scribed by V. Boyer; D. El Baz; M. Elkihel

Book ID: 113536606
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 190 KB
Volume: 61
Category: Article
ISSN: 0360-8352
DOI: 10.1016/j.cie.2010.10.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Dynamic programming algorithms for the Z

Dynamic programming algorithms for the Zero-One Knapsack Problem

✍ P. Toth 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 786 KB

Improved Dynamic Programming in Connecti

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem

✍ Hans Kellerer; Ulrich Pferschy 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 72 KB

Dynamic programming based algorithms for

Dynamic programming based algorithms for the discounted {0–1} knapsack problem

✍ Aiying Rong; José Rui Figueira; Kathrin Klamroth 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 367 KB

A hybrid dynamic programming/branch-and-

A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice knapsack problem

✍ M.E. Dyer; W.O. Riha; J. Walker 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 742 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