摘要: Local search has been applied successfully to a diverse collection of optimization problems. However, results are scattered throughout the literature. This is first book that presents large theoretical in consistent manner. It provides reader with coherent overview achievements obtained so far, and serves as source inspiration for development novel challenging field local search.
tue.nl
amazon.com
springer.com
acm.org 参考文章(9)
Edmund K Burke, Edmund K Burke, Graham Kendall, Graham Kendall, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques Springer. ,(2013)
Thomas Sttzle, Holger Hoos, Stochastic Local Search: Foundations & Applications ,(2004)
PJ Patrick Zwietering, Jhm Jan Korst, Ehl Emile Aarts, Deterministic and randomized local search Computing science notes. ,vol. 9304, pp. 143- 224 ,(1993)
Fred Glover, Tabu search—Uncharted domains Annals of Operations Research. ,vol. 149, pp. 89- 98 ,(2007) , 10.1007/S10479-006-0113-9
David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis, How easy is local search foundations of computer science. ,vol. 37, pp. 39- 42 ,(1985) , 10.1016/0022-0000(88)90046-3
Emile Aarts, Jan K. Lenstra, Local Search in Combinatorial Optimization Wiley-Interscience series in discrete mathematics and optimization. ,(1997)
Hans L. Bodlaender, Fedor V. Fomin, Equitable colorings of bounded treewidth graphs Theoretical Computer Science. ,vol. 349, pp. 22- 30 ,(2005) , 10.1016/J.TCS.2005.09.027
Eva Tardos, Jon Kleinberg, Algorithm Design ,(2005)
David Zuckerman, Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number Theory of Computing. ,vol. 3, pp. 103- 128 ,(2007) , 10.4086/TOC.2007.V003A006