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