Pages that link to "Item:Q3637178"
From MaRDI portal
The following pages link to Solving (Weighted) Partial MaxSAT through Satisfiability Testing (Q3637178):
Displaying 31 items.
- Quantified maximum satisfiability (Q272016) (← links)
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Reformulation based MaxSat robustness (Q487654) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← 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 novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
- Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains (Q2278102) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← 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)
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (Q3007689) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
- RC2: an Efficient MaxSAT Solver (Q5015603) (← 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)
- Comments on: ``An overview of curriculum-based course timetabling'' (Q5971107) (← links)
- Functional synthesis via input-output separation (Q6102165) (← links)
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization (Q6536121) (← links)
