Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
Year of publication: |
2012
|
---|---|
Authors: | Crévits, Igor ; Hanafi, Sai͏̈d ; Mansi, Rai͏̈d ; Wilbaut, Christophe |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 1, p. 32-41
|
Subject: | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming |
-
Lagrangian relaxation based heuristic for an integrated production and maintenance planning problem
Alaoui-Selsouli, M., (2012)
-
Using decomposition to improve greedy solutions of the optimal diversity management problem
Agra, Agostinho, (2013)
-
Heuristic concentration and tabu search : a nose to nose comparison
Rosing, K. E., (1997)
- More ...
-
Hybrid approaches for the two-scenario max-min knapsack problem
Hanafi, Sai͏̈d, (2012)
-
A dynamic programming algorithm for the bilevel knapsack problem
Brotcorne, Luce, (2009)
-
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
Wilbaut, Christophe, (2009)
- More ...