scientific article; zbMATH DE number 1114003

MaRDI QIDQ4375770zbMATH OpenFDO

Authors Steve Joy, Brian Borchers, John E. Mitchell

Publication date 2 June 1998

zbMATH Keywords

satisfiability problem

Mathematics Subject Classification ID

Classical propositional logic (03B05) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 956857
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT

Cited in

(19)

• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
• A branch-and-bound algorithm for solving max-\(k\)-cut problem
• Evaluating the impact of AND/OR search on 0-1 integer linear programming
• Probabilistic logic with independence
• Solving the weighted MAX-SAT problem using the dynamic convexized method
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Exact MAX-2SAT solution via lift-and-project closure
• Semidefinite programming and constraint programming
• An LPCC approach to nonconvex quadratic programs
• A tutorial on branch and cut algorithms for the maximum stable set problem
• \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• A framework for reasoning under uncertainty based on non-deterministic distance semantics
• Simplified forms of computerized reasoning with distance semantics
• MaxSAT-based cutting planes for learning graphical models
• Principles and Practice of Constraint Programming – CP 2004
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
• An efficient solver for weighted Max-SAT

This page was built for publication:

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