Pages that link to "Item:Q1761303"
From MaRDI portal
The following pages link to Optimizing with minimum satisfiability (Q1761303):
Displaying 11 items.
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- Set-weighted games and their application to the cover problem (Q2083971) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- A non-clausal tableau calculus for \textsc{MinSat} (Q2234795) (← links)
- Allocating limited resources to protect a massive number of targets using a game theoretic model (Q2298550) (← links)
- Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)