Single- and multi-objective genetic programming

DOI10.1145/2460239.2460254zbMath1369.68324OpenAlexW1975361494MaRDI QIDQ5276123

No author found.

Publication date: 14 July 2017

Published in: Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2460239.2460254

zbMATH Keywords

multi-objective optimizationgenetic programmingtheoryruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Variable solution structure can be helpful in evolutionary optimization ⋮ Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming ⋮ The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time

This page was built for publication: Single- and multi-objective genetic programming