Design efficient local search algorithms
Local search is one of the early techniques proposed during the midsixties as a practical technique to cope with the overwhelming computational intractability of NP-hard combinatorial optimization problems. In this paper, we give two cases of using local search to solve the n-queens problem and the satisfiability (SAT) problem. We have found that most practical constraint satisfaction problems (CSP) and constraint-based optimization problems can be solved by local search efficiently.
Unable to display preview. Download preview PDF.
- S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of the Third ACM Symposium on Theory of Computing, pages 151–158, 1971.Google Scholar
- M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.Google Scholar
- J. Gu. How to solve Very Large-Scale Satisfiability (VLSS) problems. 1988.Google Scholar
- J. Gu. Benchmarking SAT algorithms. Technical Report UCECE-TR-90-002, Oct. 1990.Google Scholar
- J. Gu. Constraint-Based Search. Cambridge University Press, New York, 1992.Google Scholar
- J. Gu and Q.P. Gu. Average time complexities of several local search algorithms. Submitted for publication. Jan. 1992.Google Scholar
- R. Sosič and J. Gu. Efficient local search with conflict minimization. IEEE Trans. on Knowledge and Data Engineering, 1992.Google Scholar
- H. S. Stone and J. M. Stone. Efficient search techniques — an empirical study of the n-queens problem. IBM J. Res. Develop., 31(4):464–474, July 1987.Google Scholar