Pages that link to "Item:Q5713707"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5713707):
Displaying 11 items.
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Learning dynamic algorithm portfolios (Q870809) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT (Q3007692) (← links)
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (Q3453204) (← links)