Pages that link to "Item:Q2457672"
From MaRDI portal
The following pages link to MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672):
Displaying 19 items.
- MaxSolver (Q14538) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A framework for reasoning under uncertainty based on non-deterministic distance semantics (Q541819) (← links)
- Simplified forms of computerized reasoning with distance semantics (Q545150) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- Comparing action descriptions based on semantic preferences (Q2457799) (← links)
- Exact Max-SAT solvers for over-constrained problems (Q2506236) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- On Inconsistent Clause-Subsets for Max-SAT Solving (Q3523061) (← links)
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
