Efficiency of Local Search

DOI10.1007/11814948_29MaRDI QIDQ5756557zbMATH OpenOpenAlexFDO

Authors Andrei A. Bulatov, E. S. Skvortsov

Publication date 4 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11814948_29

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Efficiency of local search with multiple local optima
• Local search: complexity and approximation
• Limits of local search: quality and efficiency
• Local search inequalities
• Applied local search
• Efficiency of a local algorithm for solving the traveling salesman problem
• scientific article; zbMATH DE number 1016966
• Mechanisms for local search
• Effectiveness of local search for geometric optimization

Cited in

(14)

• Mechanisms for local search
• Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
• New local search approximation techniques for maximum generalized satisfiability problems
• Commonalities in local search
• Phase transition for local search on planted SAT
• Tight bounds on local search to approximate the maximum satisfiability problems
• Principles of Stochastic Local Search
• scientific article; zbMATH DE number 1222824 (Why is no real title available?)
• Efficient algorithms for local ranking
• scientific article; zbMATH DE number 1884354 (Why is no real title available?)
• Local search starting from an LP solution, fast and quite good
• Stochastic Algorithms: Foundations and Applications
• Effect of initial assignment on local search performance for Max Sat
• Efficiency of a local algorithm for solving the traveling salesman problem

This page was built for publication: Efficiency of Local Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756557)