✦ LIBER ✦

An exact algorithm for the 0–1 collapsing knapsack problem

✍ Scribed by Didier Fayard; Gérard Plateau

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 733 KB
Volume: 49
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90208-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An improved parallel algorithm for 0/1 k

An improved parallel algorithm for 0/1 knapsack problem

✍ Gen-Huey Chen; Jin-Hwang Jang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 870 KB

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 exact algorithm for large unbounded k

An exact algorithm for large unbounded knapsack problems

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

An exact algorithm for large multiple kn

An exact algorithm for large multiple knapsack problems

✍ David Pisinger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 137 KB

The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total pro®t sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as ®nancial ma

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