Pages that link to "Item:Q5900327"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900327):
Displaying 11 items.
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- Finding optimal satisficing strategies for and-or trees (Q2457646) (← links)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem (Q3651486) (← links)
- \#SAT solving algorithms based on extension rule using heuristic strategies (Q5381995) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897208) (← links)