A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
From MaRDI portal
Recommendations
Cited in
(36)- Scatter search and genetic algorithms for MAX-SAT problems
- Exact Max-SAT solvers for over-constrained problems
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Quantitative possibility theory: logical- and graphical-based representations
- MAX SAT approximation beyond the limits of polynomial-time approximation
- Solving satisfiability problems with preferences
- Improving exact algorithms for MAX-2-SAT
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
- An Empirical Study of MAX-2-SAT Phase Transitions
- An efficient solver for weighted Max-SAT
- Solving weighted CSP by maintaining arc consistency
- Theory and Applications of Satisfiability Testing
- Learning hierarchical task network domains from partially observed plan traces
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- Compiling propositional weighted bases
- Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach
- Algorithms for Weighted Boolean Optimization
- Exact computation of max weighted score estimators
- Resolution for Max-SAT
- Exact algorithms for MAX-SAT
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- An LPCC approach to nonconvex quadratic programs
- Exact MAX-2SAT solution via lift-and-project closure
- On the Lower Bounds of Random Max 3 and 4-SAT
- A Spectral Method for MAX2SAT in the Planted Solution Model
- Iterative and core-guided maxsat solving: a survey and assessment
- Sums of squares based approximation algorithms for MAX-SAT
- Block linear majorants in quadratic 0--1 optimization
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- On the lower bounds of random Max 3 and 4-SAT
- Learning action models from plan examples using weighted MAX-SAT
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
This page was built for publication: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288467)
