Pages that link to "Item:Q2118385"
From MaRDI portal
The following pages link to A refined branching algorithm for the maximum satisfiability problem (Q2118385):
Displaying 7 items.
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- Branching constraint satisfaction problems and Markov decision problems compared (Q1861939) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers (Q3524192) (← links)
- Recent Advances in Constraints (Q5899109) (← links)
- Generalization of the subset sum problem and cubic forms (Q6039136) (← links)
- Targeted Branching for the Maximum Independent Set Problem (Q6159907) (← links)