Heuristics for the 0―1 multidimensional knapsack problem : Cooperative combinatorial optimization
In: European journal of operational research, Jg. 199 (2009), Heft 3, S. 658-664
Online
academicJournal
- print, 20 ref
Two heuristics for the 0-1 multidimensional knapsack problem (MKP) are presented. The first one uses surrogate relaxation, and the relaxed problem is solved via a modified dynamic-programming algorithm. The heuristics provides a feasible solution for (MKP). The second one combines a limited-branch-and-cut-procedure with the previous approach, and tries to improve the bound obtained by exploring some nodes that have been rejected by the modified dynamic-programming algorithm. Computational experiences show that our approaches give better results than the existing heuristics, and thus permit one to obtain a smaller gap between the solution provided and an optimal solution.
Titel: |
Heuristics for the 0―1 multidimensional knapsack problem : Cooperative combinatorial optimization
|
---|---|
Autor/in / Beteiligte Person: | BOYER, V ; ELKIHEL, M ; EL BAZ, D |
Link: | |
Zeitschrift: | European journal of operational research, Jg. 199 (2009), Heft 3, S. 658-664 |
Veröffentlichung: | Amsterdam: Elsevier, 2009 |
Medientyp: | academicJournal |
Umfang: | print, 20 ref |
ISSN: | 0377-2217 (print) |
Schlagwort: |
|
Sonstiges: |
|