 |
Institute for Research in Computer Science and Random Systems |  |
|
Institute for Research in Computer Science and Random Systems | |
| HAL: hal-00445839, version 1 |
| Detailed view |  Export this paper |
 |
| European Journal of Operational Research 186, 1 (2008) 63-76 |
|
|
|
|
| A dynamic programming based procedure for the multidimensional 0-1 knapsack problem |
|
|
| Stefan Balev 1Nicola Yanev 2 |
|
|
| (2008) |
|
|
|
| This paper presents a preprocessing procedure for the 0–1 multidimensional knapsack problem. First, a non-increasing sequence of upper bounds is generated by solving LP-relaxations. Then, a non-decreasing sequence of lower bounds is built using dynamic programming. The comparison of the two sequences allows either to prove that the best feasible solution obtained is optimal, or to fix a subset of variables to their optimal values. In addition, a heuristic solution is obtained. Computational experiments with a set of large-scale instances show the efficiency of our reduction scheme. Particularly, it is shown that our approach allows to reduce the CPU time of a leading commercial software. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS) |
|
|
|
Institut National des Sciences Appliquées (INSA) - Rouen – Université du Havre – Université de Rouen : EA4108 |
|
|
| 2: | SYMBIOSE (INRIA - IRISA) |
|
|
|
CNRS : UMR6074 – INRIA – Institut National des Sciences Appliquées (INSA) - Rennes – Université de Rennes 1 |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Operations Research |
| hal-00445839, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00445839 | |
| oai:hal.archives-ouvertes.fr:hal-00445839 | |
| From: Stefan Balev | |
| Submitted on: Monday, 11 January 2010 14:33:27 | |
| Updated on: Monday, 11 January 2010 14:33:27 | |
