Pages that link to "Item:Q4930591"
From MaRDI portal
The following pages link to On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (Q4930591):
Displaying 17 items.
- Analysis of local search landscapes for \(k\)-SAT instances (Q626907) (← links)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← links)
- New local search approximation techniques for maximum generalized satisfiability problems (Q1351586) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q1581848) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation (Q1850970) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Randomness in heuristics: An experimental investigation for the maximum satisfiability problem (Q2768133) (← links)
- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems (Q3569759) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- Experimental and Efficient Algorithms (Q5710050) (← links)
- Effect of initial assignment on local search performance for Max Sat (Q6487603) (← links)
