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

DOI10.1007/978-3-030-77876-7_8zbMATH Open1487.90483OpenAlexW3172251713MaRDI QIDQ2117621FDOQ2117621

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

Publication date: 22 March 2022

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

Recommendations

• Using merging variables-based local search to solve special variants of MaxSAT problem
• Solving the SAT problem based on evolutionary algorithm
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the analysis of a dynamic evolutionary algorithm
• scientific article; zbMATH DE number 1703859

zbMATH Keywords

evolutionary algorithmsBoolean satisfiability problemMaxSAT problemmerging variables principle

Mathematics Subject Classification ID

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

Cites Work

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

Uses Software

• Transalg
• MapleAmpharos

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117621)