Pages that link to "Item:Q646517"
From MaRDI portal
The following pages link to Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517):
Displayed 9 items.
- New local search methods for partial MaxSAT (Q329035) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (Q3453204) (← links)