Puchinger, J., Raidl, G.R. and Gruber, M. (2005) Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem. Proceeding of the 6th Metaheuristics International Conference, Vienna, 22-26 August 2005, 775-780.

has been cited by the following article:

• TITLE: A Weight-Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem

  AUTHORS: Quan Yuan, Zhixin Yang

  KEYWORDS: Weight-Coding, Evolutionary Algorithm, Multidimensional Knapsack Problem (MKP)

  JOURNAL NAME: Advances in Pure Mathematics, Vol.6 No.10, September 19, 2016

  ABSTRACT: A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm pro-posed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.