✦ LIBER ✦

Hard multidimensional multiple choice knapsack problems, an empirical study

✍ Scribed by Bing Han; Jimmy Leblet; Gwendal Simon

Book ID: 108105930
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 414 KB
Volume: 37
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2009.04.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Development of core to solve the multidi

Development of core to solve the multidimensional multiple-choice knapsack problem

✍ Taha Ghasemi; Mohammadreza Razzazi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 426 KB

The multidimensional multiple-choice knapsack problem (MMKP) is an extension of the 0-1 knapsack problem. The core concept has been used to design efficient algorithms for the knapsack problem but the core has not been developed for the MMKP so far. In this paper, we develop an approximate core for

A best first search exact algorithm for

A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem

✍ Abdelkader Sbihi 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 348 KB

Fusing ant colony optimization with Lagr

Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem

✍ Zhi-gang Ren; Zu-ren Feng; Ai-min Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 796 KB

An O(n) algorithm for the linear multipl

An O(n) algorithm for the linear multiple choice knapsack problem and related problems

✍ Eitan Zemel 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 496 KB