𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity Results and Exact Algorithms for Robust Knapsack Problems

✍ Scribed by Talla Nobibon, Fabrice; Leus, Roel

Book ID
121338779
Publisher
Springer
Year
2013
Tongue
English
Weight
607 KB
Volume
161
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some exact algorithms for the knapsack s
Some exact algorithms for the knapsack sharing problem
✍ Takeo Yamada; Mayumi Futakawa; Seiji Kataoka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 446 KB

The knapsack sharing problem (KSP) is formulated as an extension to the ordinary knapsack problem. The KSP is .AlP-hard. We present a branch-and-bound algorithm and a binary search algorithm to solve this problem to optimality. These algorithms are implemented and computational experiments are carde

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