Pages that link to "Item:Q1288467"
From MaRDI portal
The following pages link to A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems (Q1288467):
Displaying 36 items.
- Exact computation of max weighted score estimators (Q295700) (← links)
- Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach (Q367248) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Solving weighted CSP by maintaining arc consistency (Q814626) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- On the lower bounds of random Max 3 and 4-SAT (Q1752631) (← links)
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances (Q1776200) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- Learning hierarchical task network domains from partially observed plan traces (Q2453731) (← links)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- Exact Max-SAT solvers for over-constrained problems (Q2506236) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- Algorithms for Weighted Boolean Optimization (Q3637182) (← links)
- Quantitative possibility theory: logical- and graphical-based representations (Q4583355) (← links)
- On the Lower Bounds of Random Max 3 and 4-SAT (Q4632196) (← links)
- Exact Algorithms for MAX-SAT (Q4916231) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)
- Theory and Applications of Satisfiability Testing (Q5713725) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
