Pages that link to "Item:Q933784"
From MaRDI portal
The following pages link to An efficient solver for weighted Max-SAT (Q933784):
Displaying 15 items.
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- The \textsc{WeightedCircuitsLmax} constraint (Q1626773) (← links)
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT (Q1656559) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- (Q3112651) (← links)
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem (Q3651486) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)
- Theory and Applications of Satisfiability Testing (Q5713725) (← links)
