{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:32Z","timestamp":1750307732837,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,6,20]],"date-time":"2009-06-20T00:00:00Z","timestamp":1245456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2009,6,20]]},"DOI":"10.1145\/1556154.1556161","type":"journal-article","created":{"date-parts":[[2009,6,24]],"date-time":"2009-06-24T16:47:07Z","timestamp":1245862027000},"page":"27-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Review of theoretical aspects of local search by Wil P. A. J. Michiels, Emile H. L. Aarts, and Jan H. M. Korst (Springer in the EATCS Series Monographs in Theoretical Computer Science, 007)"],"prefix":"10.1145","volume":"40","author":[{"given":"Jakub","family":"Mare\u010dek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,20]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"E. H. L. Aarts J. H. M. Korst and P. Zwietering. Deterministic and randomized local search. In P. Smolensky M. C. Mozer and D. E. Rumelhart editors Mathematical perspectives of neural networks pages 43-224. Lawrence Erlbaum Associates Mahwah NJ 996.  E. H. L. Aarts J. H. M. Korst and P. Zwietering. Deterministic and randomized local search. In P. Smolensky M. C. Mozer and D. E. Rumelhart editors Mathematical perspectives of neural networks pages 43-224. Lawrence Erlbaum Associates Mahwah NJ 996."},{"key":"e_1_2_1_2_1","unstructured":"E. H. L. Aarts and J. K. Lenstra. Local Search in Combinatorial Optimization. Wiley-Interscience Chichester UK 997.   E. H. L. Aarts and J. K. Lenstra. Local Search in Combinatorial Optimization . Wiley-Interscience Chichester UK 997."},{"key":"e_1_2_1_3_1","unstructured":"E. H. L. Aarts and J. K. Lenstra. Preface. In Local Search in Combinatorial Optimization {2} pages vii-viii.  E. H. L. Aarts and J. K. Lenstra. Preface. In Local Search in Combinatorial Optimization {2} pages vii-viii."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.027"},{"key":"e_1_2_1_5_1","unstructured":"E. K. Burke and G. Kendall editors. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer New York NY 005.  E. K. Burke and G. Kendall editors. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques . Springer New York NY 005."},{"key":"e_1_2_1_6_1","first-page":"89","article-title":"Ann","volume":"49","author":"Glover F.","year":"2007","journal-title":"Oper. Res."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90185-9"},{"key":"e_1_2_1_8_1","unstructured":"P. Hlineny S. il Oum D. Seese and G. Gottlob. Width parameters beyond tree-width and their applications. Computer J. to appear. 0.1093\/comjnl\/bxm052.  P. Hlineny S. il Oum D. Seese and G. Gottlob. Width parameters beyond tree-width and their applications. Computer J. to appear. 0.1093\/comjnl\/bxm052."},{"key":"e_1_2_1_9_1","unstructured":"H. Hoos and T. St\u00fctzle. Stochastic Local Search: Foundations & Applications. Morgan Kaufmann San Francisco CA 004.   H. Hoos and T. St\u00fctzle. Stochastic Local Search: Foundations & Applications . Morgan Kaufmann San Francisco CA 004."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_2_1_11_1","unstructured":"J. Kleinberg and E. Tardos. Algorithm Design. Addison-Wesley Longman Boston MA 005.   J. Kleinberg and E. Tardos. Algorithm Design . Addison-Wesley Longman Boston MA 005."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"e_1_2_1_13_1","first-page":"14","volume-title":"Proc. th Annual Allerton Conference on Circuit and Systems Theory","author":"Steiglitz K.","year":"1968"},{"first-page":"19","volume-title":"Local Search in Combinatorial Optimization {2}","author":"Yannakakis M.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","unstructured":"D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. (6):103-128 2007. http:\/\/www.theoryofcomputing.org\/ articles\/main\/v03\/a006.  D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. (6):103-128 2007. http:\/\/www.theoryofcomputing.org\/ articles\/main\/v03\/a006."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1556154.1556161","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1556154.1556161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:45Z","timestamp":1750253925000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1556154.1556161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,20]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6,20]]}},"alternative-id":["10.1145\/1556154.1556161"],"URL":"https:\/\/doi.org\/10.1145\/1556154.1556161","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2009,6,20]]},"assertion":[{"value":"2009-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}