Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines

MaRDI QIDQ2726419zbMATH OpenFDO

Authors C. Hernández, F. X. Albizuri, A. D'Anjou, M. Graâ, F. J. Torrealdea

Publication date 18 July 2001

Published in Revista Investigación Operacional (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationconfiguration neigborhoodconsistent configurationshigher order Boltzmann machinesnonlinear 0-1 problemsatisfiability

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Boolean programming (90C09) Combinatorial optimization (90C27) Nonlinear programming (90C30)

Review text

The authors develop a mapping of SAT and MAX-SAT into HOBM. They are modeled as 0-1 nonlinear optimization problems. Experiments are performed for studying the accuracy of the proposed methods.

Recommendations

• Minimaxsat: an efficient weighted Max-SAT solver
• scientific article; zbMATH DE number 1630006
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• scientific article; zbMATH DE number 956858
• scientific article; zbMATH DE number 2040650

Cited in

(3)

• scientific article; zbMATH DE number 558545 (Why is no real title available?)
• scientific article; zbMATH DE number 2040650 (Why is no real title available?)
• Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study

This page was built for publication: Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines

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