2 articles tagged with #local-search. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers present an empirical study of parallel Continuous Local Search (CLS) as a method for solving Boolean satisfiability problems with pseudo-Boolean constraints. Key findings reveal that redundant constraints can slow convergence, CLS shows promise as a hybrid solver component, and local search quickly plateaus due to saddle-dense optimization landscapes.
Researchers demonstrate that Baldwinian and Lamarckian evolutionary algorithms significantly outperform traditional Darwinian evolution on complex optimization problems like Maximum Independent Set and Maximum Cut. The study provides both empirical validation across multiple datasets and theoretical runtime analysis, showing that local search-augmented evolutionary algorithms offer practical advantages for solving NP-hard graph problems.
