Pages that link to "Item:Q2385178"
From MaRDI portal
The following pages link to Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques (Q2385178):
Displaying 10 items.
- Reformulation based MaxSat robustness (Q487654) (← links)
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers (Q1656563) (← links)
- Incomplete dynamic backtracking for linear pseudo-Boolean problems (Q1876529) (← links)
- Search techniques for SAT-based Boolean optimization (Q2455454) (← links)
- (Q3429158) (← links)
- (Q3429161) (← links)
- (Q3429162) (← links)
- (Q4475671) (← links)
- (Q5687271) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897213) (← links)