{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:03Z","timestamp":1725558363284},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_37","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:23:52Z","timestamp":1277227432000},"page":"424-438","source":"Crossref","is-referenced-by-count":2,"title":["A Model for Analyzing Black-Box Optimization"],"prefix":"10.1007","author":[{"given":"Vinhthuy","family":"Phan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Sumazin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","volume-title":"The Traveling Salesman Problem: A Case Study","author":"E. Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.K.: The Traveling Salesman Problem: A Case Study. Wiley, Chichester (1997)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Allender, E., Impagliazzo, R., Pitassi, T., Rudich, S.: Reducing the complexity of reductions. In: ACM Symposium on Theory of Computing, pp. 730\u2013738 (1997)","DOI":"10.1145\/258533.258671"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Aldous, D., Vazirani, U.V.: Go with the Winners algorithms. In: IEEE Symposium on Foundations of Computer Science, pp. 492\u2013501 (1994)","DOI":"10.1109\/SFCS.1994.365742"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. In: ACM Symposium on Theory of Computing, pp. 303\u2013314 (1995)","DOI":"10.1145\/225058.225147"},{"key":"37_CR5","unstructured":"Carson, T., Impagliazzo, R.: Hill-climbing finds random planted bisections. In: Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 903\u2013909 (2001)"},{"key":"37_CR6","unstructured":"Gutin, G., Yeo, A.: TSP heuristics with large domination number. Technical Report PP-1998-13, Odense University, Denmark, August 20 (1998)"},{"key":"37_CR7","unstructured":"Gutin, G., Yeo, A., Zverivich, A.: Polynominal restriction approach for the atsp and stsp. The Traveling Salesman Problem (to appear)"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"Hajek, B.: Cooling schedules for optimal simulated annealing. Math. Operations Res.\u00a013, 311\u2013329 (1988)","journal-title":"Math. Operations Res."},{"key":"37_CR9","first-page":"61","volume":"2","author":"Y. Ho","year":"1992","unstructured":"Ho, Y., Sreeniva, R., Vakili, P.: Ordinal optimization of discrete event dynamic systems. J. on DEDS\u00a02, 61\u201368 (1992)","journal-title":"J. on DEDS"},{"key":"#cr-split#-37_CR10.1","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? In: Proc. 26th Annual Symp. on Foundations of Computer Science, pp. 39\u201342 (1985);","DOI":"10.1109\/SFCS.1985.31"},{"key":"#cr-split#-37_CR10.2","doi-asserted-by":"crossref","unstructured":"Also J. Computer System Sci. 37(1), 79-100 (1988)","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"37_CR11","unstructured":"Juels, A.: Topics in black box optimization. Ph.D. Thesis, University of California, Berkeley (1996)"},{"issue":"1","key":"37_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell system technical journal\u00a049(1), 291\u2013307 (1970)","journal-title":"The Bell system technical journal"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"37_CR14","first-page":"299","volume":"5","author":"O. Martin","year":"1991","unstructured":"Martin, O., Otto, S., Felten, E.: Large-step markov chains for the traveling salesman problem. Complex Systems\u00a05, 299\u2013326 (1991)","journal-title":"Complex Systems"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Schaffer, A., Yannakakis, M.: On the complexity of local search. In: Proc. 22nd Annual ACM Symp. on Theory of Computing, pp. 438\u2013445 (1990)","DOI":"10.1145\/100216.100274"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Phan, V., Sumazin, P., Skiena, S.: A time-sensitive system for black-box combinatorial optimization. In: 4th Workshop on Algorithm Engineering and Experiments, San Francisco, USA (January 2002)","DOI":"10.1007\/3-540-45643-0_2"},{"key":"37_CR17","unstructured":"Reinelt, G.: TSPLIB. University of Heidelberg, \n                  \n                    www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95"},{"key":"37_CR18","unstructured":"Resende, M.: Max-Satisfiability Data. Information Sciences Research Center, AT&T, \n                  \n                    www.research.att.com\/~mgcr"},{"key":"37_CR19","first-page":"57","volume-title":"Local Search and Combinatorial Optimization","author":"C.A. Tovey","year":"1997","unstructured":"Tovey, C.A.: Local improvements on discrete structures. In: Aarts, E., Lenstra, J.K. (eds.) Local Search and Combinatorial Optimization, pp. 57\u201389. John Wiley and Sons Ltd., Chichester (1997)"},{"issue":"1","key":"37_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation\u00a01(1), 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:25:33Z","timestamp":1552598733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}