✦ LIBER ✦

Dynamic Programming Revisited: Improving Knapsack Algorithms

✍ Scribed by U. Pferschy

Book ID: 106202934
Publisher: Springer Vienna
Year: 1999
Tongue: English
Weight: 84 KB
Volume: 63
Category: Article
ISSN: 0010-485X
DOI: 10.1007/s006070050042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic programming algorithms for the Z

Dynamic programming algorithms for the Zero-One Knapsack Problem

✍ P. Toth 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 786 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 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

Evolutionary algorithms and dynamic prog

Evolutionary algorithms and dynamic programming

✍ Benjamin Doerr; Anton Eremeev; Frank Neumann; Madeleine Theile; Christian Thysse 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Dynamic programming approaches to the mu

Dynamic programming approaches to the multiple criteria knapsack problem

✍ Kathrin Klamroth; Margaret M. Wiecek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul

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