1. BRUHN, P. (2000): Genetische Programmierung auf Basis beschränkter kontextfreier Sprachen zur Lösung kombinatorischer Optimierungsprobleme. Phd Thesis, Wirtschaftsuniversität Wien.
2. BRUHN, P. and GEYER-SCHULZ, A. (2002): Genetic Programming Over Context-Free Languages with Linear Constraints for the Knapsack Problem: First Results. Journal of Evolutionary Computation, 10(1), 51–74.
3. GOLDBERG, D.E. (2001): Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Pub Co, New York. Ed. 22.
4. GOTTLIEB, J. and RAIDL, G.R. (2000): Characterizing locality in decoder-based eas for the multidimensional knapsack problem. In: C. Fonlupt, J.-K. Hao, E. Lutton, E. Ronald, and M. Schoenauer (Eds.): Proceedings of the 4th Conference on Artificial Evolution. Springer-Verlag, Berlin, 38–51.
5. KOZA, J.R. (1998): Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA. Ed. 6.