Application of sedimentation algorithm for solving max-sat problem

zbMATH Open1458.90548MaRDI QIDQ5280028FDOQ5280028

Authors: S. Kordic 

Publication date: 19 July 2017

Recommendations

• scientific article; zbMATH DE number 956864
• A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
• Parallel genetic algorithm for SAT problems based on OpenMP
• Selection of search strategies for solving 3-SAT problems
• scientific article; zbMATH DE number 776082

zbMATH Keywords

combinatorial optimisationBoolean satisfiabilitysolverMax-SATsedimentation algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

This page was built for publication: Application of sedimentation algorithm for solving max-sat problem

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