Pages that link to "Item:Q329035"
From MaRDI portal
The following pages link to New local search methods for partial MaxSAT (Q329035):
Displaying 11 items.
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- Cooperative parallel SAT local search with path relinking (Q2057122) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
- Core-boosted linear search for incomplete MaxSAT (Q2327238) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (Q4930591) (← links)
- Integrating multi-armed bandit with local search for MaxSAT (Q6665727) (← links)