Cited in
(25)- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- A framework for certified Boolean branch-and-bound optimization
- Solving satisfiability problems with preferences
- A framework for reasoning under uncertainty based on non-deterministic distance semantics
- Simplified forms of computerized reasoning with distance semantics
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- scientific article; zbMATH DE number 5785317 (Why is no real title available?)
- A logical approach to efficient Max-SAT solving
- OptSAT
- Pueblo
- UBCSAT
- MAX-2-SAT
- PBS
- MiniMaxSat
- MSUnCore
- Iterative and core-guided maxsat solving: a survey and assessment
- Comparing action descriptions based on semantic preferences
- Exact Max-SAT solvers for over-constrained problems
- Semidefinite programming and constraint programming
- On SAT Modulo Theories and Optimization Problems
- Scatter search and genetic algorithms for MAX-SAT problems
- Minimaxsat: an efficient weighted Max-SAT solver
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for software: MaxSolver
