Theoretical aspects of local search
暂无分享,去创建一个
[1] Harvey J. Greenberg,et al. New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .
[2] Georg Gottlob,et al. Width Parameters Beyond Tree-width and their Applications , 2008, Comput. J..
[3] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[4] Jan Korst,et al. Deterministic and randomized local search , 1993 .
[5] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[6] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[7] Fred W. Glover,et al. Tabu search—Uncharted domains , 2007, Ann. Oper. Res..
[8] Éva Tardos,et al. Algorithm design , 2005 .
[9] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[10] Graham Kendall,et al. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .
[11] Fedor V. Fomin,et al. Equitable Colorings of Bounded Treewidth Graphs , 2004, MFCS.