Using merging variables-based local search to solve special variants of MaxSAT problem

DOI10.1007/978-3-030-58657-7_29MaRDI QIDQ4965126zbMATH OpenOpenAlexFDO

Authors Ilya Otpuschennikov, Aleksandr Anatol'evich Semënov

Publication date 25 February 2021

Published in Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

branch location problemcryptographic hash functionsevolutionary algorithmslocal searchMaxSATpseudo-Boolean optimizationSAT

Mathematics Subject Classification ID

Boolean programming (90C09) Combinatorial optimization (90C27)

Recommendations

• On some variants of the merging variables based (1+1)-evolutionary algorithm with application to MaxSAT problem
• New local search methods for partial MaxSAT
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• scientific article; zbMATH DE number 1114009
• Analyses on the 2 and 3-flip neighborhoods for the MAX SAT

Cites work

• A computational study of local search algorithms for Italian high-school timetabling
• A survey of very large-scale neighborhood search techniques
• Computational Complexity
• Core-boosted linear search for incomplete MaxSAT
• Decomposition representations of logical equations in problems of inversion of discrete functions
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1257634 (Why is no real title available?)
• scientific article; zbMATH DE number 1113992 (Why is no real title available?)
• scientific article; zbMATH DE number 1754585 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 7199588 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• Iterative and core-guided maxsat solving: a survey and assessment
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Location science
• Merging variables: one technique of search in pseudo-Boolean optimization
• On the analysis of the \((1+1)\) evolutionary algorithm
• Progression in maximum satisfiability
• Pseudo-Boolean optimization
• PySAT: a Python toolkit for prototyping with SAT oracles
• RC2: an efficient MaxSAT solver
• SAT-based MaxSAT algorithms
• The complexity of theorem-proving procedures
• Variable neighborhood search

Cited in

(1)

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

Describes a project that uses

Uses Software

• YalSAT
• MaxHS
• RC2
• PaInleSS
• Plingeling
• Lingeling
• CaDiCaL
• Treengeling
• PySAT

This page was built for publication: Using merging variables-based local search to solve special variants of MaxSAT problem

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