The multidimensional 0–1 knapsack problem: An overview
| Autor: | Arnaud Fréville |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Mathematical optimization
Information Systems and Management General Computer Science Continuous knapsack problem Management Science and Operations Research Industrial and Manufacturing Engineering Cutting stock problem Knapsack problem Modeling and Simulation Preprocessor Change-making problem Heuristics Integer programming Generalized assignment problem Mathematics |
| Zdroj: | European Journal of Operational Research. 155:1-21 |
| ISSN: | 0377-2217 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect