Jens Gottlieb On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP] Artificial Evolution, 1999, pp:23-37 [Conf]
Jens Gottlieb On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems. [Citation Graph (0, 0)][DBLP] EvoWorkshops, 2001, pp:50-59 [Conf]
Jens Gottlieb Evolutionary Algorithms for Multidimensional Knapsack Problems: the Relevance of the Boundary f the Feasible Region. [Citation Graph (0, 0)][DBLP] GECCO, 1999, pp:787- [Conf]
Jens Gottlieb, Nico Voss Improving the Performance of Evolutionary Algorithms for the Satisfiability Problem by Refining Functions. [Citation Graph (0, 0)][DBLP] PPSN, 1998, pp:755-764 [Conf]
Jens Gottlieb Permutation-Based Evolutionary Algorithms for Multidimensional Knapsack Problems. [Citation Graph (0, 0)][DBLP] SAC (1), 2000, pp:408-414 [Conf]
Günther R. Raidl, Jens Gottlieb Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP] Evolutionary Computation, 2005, v:13, n:4, pp:441-475 [Journal]