The following pages link to (Q3624095):
Displaying 36 items.
- New local search methods for partial MaxSAT (Q329035) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Resolution-based lower bounds in MaxSAT (Q606913) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- A proof builder for Max-SAT (Q2118341) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- Model-lite planning: case-based vs. model-based approaches (Q2407874) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- Learning hierarchical task network domains from partially observed plan traces (Q2453731) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- On Inconsistent Clause-Subsets for Max-SAT Solving (Q3523061) (← links)
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing (Q3637178) (← links)
- Exploiting Cycle Structures in Max-SAT (Q3637180) (← links)
- Algorithms for Weighted Boolean Optimization (Q3637182) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← 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)
- Resizing cardinality constraints for MaxSAT (Q5145443) (← links)
- Proofs and Certificates for Max-SAT (Q5870516) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
