A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
From MaRDI portal
Publication:1288467
DOI10.1023/A:1009725216438zbMath0954.90026OpenAlexW1581661059MaRDI QIDQ1288467
Publication date: 9 February 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009725216438
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Exact computation of max weighted score estimators, Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach, Solving satisfiability problems with preferences, Quantitative possibility theory: logical- and graphical-based representations, Boosting branch-and-bound MaxSAT solvers with clause learning, Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT., An LPCC approach to nonconvex quadratic programs, Solving the weighted MAX-SAT problem using the dynamic convexized method, An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem, Scatter search and genetic algorithms for MAX-SAT problems, Learning hierarchical task network domains from partially observed plan traces, An efficient solver for weighted Max-SAT, On the Lower Bounds of Random Max 3 and 4-SAT, MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability, Sums of squares based approximation algorithms for MAX-SAT, Exact MAX-2SAT solution via lift-and-project closure, On the lower bounds of random Max 3 and 4-SAT, Exploiting subproblem optimization in SAT-based maxsat algorithms, Exact Algorithms for MAX-SAT, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Block linear majorants in quadratic 0--1 optimization, Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances, Exact Max-SAT solvers for over-constrained problems, MAX SAT approximation beyond the limits of polynomial-time approximation, A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem, Algorithms for Weighted Boolean Optimization, Learning action models from plan examples using weighted MAX-SAT, Resolution for Max-SAT, Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems, An Empirical Study of MAX-2-SAT Phase Transitions, Iterative and core-guided maxsat solving: a survey and assessment, Improving exact algorithms for MAX-2-SAT, Compiling propositional weighted bases, Solving weighted CSP by maintaining arc consistency
Uses Software
