Research Article
A Memetic Lagrangian Heuristic for the 0-1 Multidimensional
Knapsack Problem
Algorithm 1
Randomized constructive heuristic [
13,
19].
R-CONS(0-1MKP instance) | { | ; | ; | do | random integer in ; | for | ; | ; | ; | ; | until satisfies all the constraints; | return ; | } |
|