On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem

DOI10.1007/978-3-030-77876-7_8zbMath1487.90483OpenAlexW3172251713MaRDI QIDQ2117621

Ilya Otpuschennikov, Aleksandr Anatol'evich Semënov, Kirill Antonov

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_8

zbMATH Keywords

evolutionary algorithmsBoolean satisfiability problemMaxSAT problemmerging variables principle

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• Transalg
• MapleAmpharos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudo-Boolean optimization
• On the analysis of the \((1+1)\) evolutionary algorithm
• Multiplicative drift analysis
• Black-box optimization in an extended search space for SAT solving
• Analyzing randomized search heuristics via stochastic domination
• Comparing evolutionary algorithms to the (\(1+1\))-EA
• Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
• Merging Variables: One Technique of Search in Pseudo-Boolean Optimization

This page was built for publication: On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem