The multidimensional 0–1 knapsack problem: An overview

The multidimensional 0–1 knapsack problem is one of the most well-known integer programming problems and has received wide attention from the operational research community during the last four decades. Although recent advances have made possible the solution of medium size instances, solving this N...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European Journal of Operational Research Ročník 155; číslo 1; s. 1 - 21
Hlavní autor: Freville, Arnaud
Médium: Book Review Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.05.2004
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Algorithms
Branch-and-bound algorithms
Heuristic
Heuristics
Integer programming
Knapsack problem
Multidimensional 0–1 knapsack problem
Preprocessing
Probabilistic and worst-case analysis
Studies
Surrogate duality
Multidimensional 0–1 knapsack problem
Surrogate duality
Preprocessing
Heuristics
Branch-and-bound algorithms
Probabilistic and worst-case analysis
ISSN:0377-2217, 1872-6860
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 is one of the most well-known integer programming problems and has received wide attention from the operational research community during the last four decades. Although recent advances have made possible the solution of medium size instances, solving this NP-hard problem remains a very interesting challenge, especially when the number of constraints increases. This paper surveys the main results published in the literature. The focus is on the theoretical properties as well as approximate or exact solutions of this special 0–1 program.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(03)00274-1