The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects

The multidimensional 0-1 knapsack problem (MKP) is a resource allocation model that is one of the most well-known integer programming problems. During the last few decades, an impressive amount of research on the 0-1 knapsack problem has been published in the literature, and efficient special-purpos...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 139; číslo 1; s. 195 - 227
Hlavní autoři: Fréville, Arnaud, Hanafi, SaÏd
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.10.2005
Témata:
Capital budgeting
Integer programming
Knapsack problem
Operations research
Software
Studies
ISSN:0254-5330, 1572-9338
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The multidimensional 0-1 knapsack problem (MKP) is a resource allocation model that is one of the most well-known integer programming problems. During the last few decades, an impressive amount of research on the 0-1 knapsack problem has been published in the literature, and efficient special-purpose methods have become available for solving very large-scale instances. However, the multidimensional case has received less attention from the operational research community. Although recent advances have made solving medium size instances possible, solving the NP-hard problem remains a very interesting challenge, especially when the number of constraints increases. This paper surveys the principal results published in the literature concerning both the problem's theoretical properties and its approximate or exact solutions. The paper focuses on the more recent results - for example, those relevant to surrogate and composite duality, new preprocessing approaches creating enhanced versions of leading commercial software, and efficient metaheuristic-based methods. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-005-3448-8