Pages that link to "Item:Q814612"
From MaRDI portal
The following pages link to Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612):
Displaying 10 items.
- Analysis of local search landscapes for \(k\)-SAT instances (Q626907) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- Boosting quantum annealer performance via sample persistence (Q1674555) (← links)
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← links)
- Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem (Q2482999) (← links)
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808) (← links)
- Decomposing SAT Instances with Pseudo Backbones (Q3304190) (← links)
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)