A "reduce and solve" approach for the multiple-choice multidimensional knapsack problem
Year of publication: |
2014
|
---|---|
Authors: | Chen, Yuning ; Hao, Jin-Kao |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 239.2014, 2 (1.12.), p. 313-322
|
Subject: | Knapsack | Fixing heuristics | Linear relaxation | Hybridization | Theorie | Theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
A dual heuristic for mixed integer programming
Li, Yaxian, (2015)
-
An iterative algorithm for the max-min knapsack problem with multiple scenarios
Al-douri, Thekra, (2021)
- More ...
-
A “reduce and solve” approach for the multiple-choice multidimensional knapsack problem
Chen, Yuning, (2014)
-
Iterated responsive threshold search for the quadratic multiple knapsack problem
Chen, Yuning, (2015)
-
A hybrid metaheuristic approach for the capacitated arc routing problem
Chen, Yuning, (2016)
- More ...