Pages that link to "Item:Q3524192"
From MaRDI portal
The following pages link to Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers (Q3524192):
Displaying 20 items.
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- Resolution-based lower bounds in MaxSAT (Q606913) (← links)
- Soft arc consistency revisited (Q969527) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Exact Max-SAT solvers for over-constrained problems (Q2506236) (← links)
- Modelling Max-CSP as Partial Max-SAT (Q3502687) (← links)
- A Preprocessor for Max-SAT Solvers (Q3502688) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- On Inconsistent Clause-Subsets for Max-SAT Solving (Q3523061) (← links)
- Exploiting Cycle Structures in Max-SAT (Q3637180) (← 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)
- Integrating multi-armed bandit with local search for MaxSAT (Q6665727) (← links)
