✦ LIBER ✦

Dynamic programming algorithms for the Zero-One Knapsack Problem

✍ Scribed by P. Toth

Publisher: Springer Vienna
Year: 1980
Tongue: English
Weight: 786 KB
Volume: 25
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02243880

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

A heuristic algorithm for the multidimen

A heuristic algorithm for the multidimensional zero-one knapsack problem

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

Solution of the zero-one multiple knapsa

Solution of the zero-one multiple knapsack problem

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 691 KB

A Bound and Bound algorithm for the zero

A Bound and Bound algorithm for the zero-one multiple knapsack problem

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 791 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

A heuristic solution procedure for the m

A heuristic solution procedure for the multiconstraint zero-one knapsack problem

✍ Hasan Pirkul 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 700 KB