✦ LIBER ✦

Heuristic algorithms for the multiple knapsack problem

✍ Scribed by S. Martello; P. Toth

Publisher: Springer Vienna
Year: 1981
Tongue: English
Weight: 835 KB
Volume: 27
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02243544

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

LP based heuristics for the multiple kna

LP based heuristics for the multiple knapsack problem with assignment restrictions

✍ Geir Dahl; Njål Foldnes 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 346 KB

A minimal algorithm for the multiple-cho

A minimal algorithm for the multiple-choice knapsack problem

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1017 KB

A successive approximation algorithm for

A successive approximation algorithm for the multiple knapsack problem

✍ Zhenbo Wang; Wenxun Xing 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 420 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 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