Pages that link to "Item:Q2327238"
From MaRDI portal
The following pages link to Core-boosted linear search for incomplete MaxSAT (Q2327238):
Displaying 9 items.
- Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
- Learning variable activity initialisation for lazy clause generation solvers (Q2117201) (← links)
- Efficient local search for pseudo Boolean optimization (Q2118314) (← links)
- On preprocessing for weighted MaxSAT (Q2234104) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
- SAT-based optimal classification trees for non-binary data (Q6049430) (← links)
- An efficient local search algorithm for minimum positive influence dominating set problem (Q6109569) (← links)
- Integrating multi-armed bandit with local search for MaxSAT (Q6665727) (← links)