BG-WalkSAT
From MaRDI portal
Software:17188
No author found.
Related Items (22)
The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability ⋮ Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Boosting quantum annealer performance via sample persistence ⋮ Analysis of local search landscapes for \(k\)-SAT instances ⋮ Unnamed Item ⋮ Instance-specific multi-objective parameter tuning based on fuzzy logic ⋮ Scatter search and genetic algorithms for MAX-SAT problems ⋮ Combining VNS with constraint programming for solving anytime optimization problems ⋮ Automated reformulation of specifications by safe delay of constraints ⋮ Towards backbone computing: A Greedy-Whitening based approach ⋮ Theory and Applications of Satisfiability Testing ⋮ Decomposing SAT Instances with Pseudo Backbones ⋮ Backbone analysis and algorithm design for the quadratic assignment problem ⋮ Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem ⋮ C-Strategy: A Dynamic Adaptive Strategy for the CLONALG Algorithm ⋮ Eliminating Redundant Clauses in SAT Instances ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ Cooperative parallel SAT local search with path relinking ⋮ Unnamed Item ⋮ General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic ⋮ Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability ⋮ On Computing Backbones of Propositional Theories
This page was built for software: BG-WalkSAT
