The following pages link to MiniMaxSat (Q21711):
Displayed 38 items.
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← 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)
- Resolution-based lower bounds in MaxSAT (Q606913) (← links)
- Russian doll search for the Steiner triple covering problem (Q644513) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- Soft arc consistency revisited (Q969527) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← 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)
- Inductive theorem proving based on tree grammars (Q2344621) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Computational protein design as an optimization problem (Q2453727) (← 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)
- Improvements to Core-Guided Binary Search for MaxSAT (Q2843334) (← links)
- Pruning Search Space for Weighted First Order Horn Clause Satisfiability (Q3007606) (← links)
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (Q3007689) (← links)
- Semiring-Induced Propositional Logic: Definition and Basic Algorithms (Q3066107) (← links)
- Solving disjunctive temporal problems with preferences using maximum satisfiability (Q3164971) (← links)
- Planning as satisfiability with IPC simple preferences and action costs (Q3164979) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- (Q3604010) (← 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)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- Exploiting the Power of mip Solvers in maxsat (Q5326460) (← links)