Partition Crossover for Pseudo-Boolean Optimization
From MaRDI portal
Publication:2981894
DOI10.1145/2725494.2725497zbMath1361.68209OpenAlexW2072262316MaRDI QIDQ2981894
Darrell Whitley, Renato Tinós, Francisco Chicano
Publication date: 10 May 2017
Published in: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2725494.2725497
combinatorial optimizationevolutionary computationpseudo-Boolean optimizationNK landscapesrecombination operatorspartition crossover
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation ⋮ Quasi-optimal recombination operator ⋮ Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions ⋮ Decomposing SAT Instances with Pseudo Backbones
Cites Work