{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T11:10:02Z","timestamp":1739185802187,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642025679"},{"type":"electronic","value":"9783642025686"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02568-6_23","type":"book-chapter","created":{"date-parts":[[2009,6,25]],"date-time":"2009-06-25T12:54:02Z","timestamp":1245934442000},"page":"221-230","source":"Crossref","is-referenced-by-count":6,"title":["Caching in the TSP Search Space"],"prefix":"10.1007","author":[{"given":"David","family":"Karhi","sequence":"first","affiliation":[]},{"given":"Dan E.","family":"Tamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"23_CR2","volume-title":"Heuristics: Intelligent search strategies for computer problem solving","author":"J. Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley, Reading (1984)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"23_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","volume-title":"The simple genetic algorithm: Foundations and theory","author":"M.D. Vose","year":"1999","unstructured":"Vose, M.D.: The simple genetic algorithm: Foundations and theory. MIT Press, Cambridge (1999)"},{"key":"23_CR5","volume-title":"Artificial intelligence: A modern approach","author":"S.J. Russell","year":"1995","unstructured":"Russell, S.J., Norvig, P.: Artificial intelligence: A modern approach, 2nd edn. Prentice-Hall, Englewood Cliffs (1995)","edition":"2"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Xi, B., Liu, Z., Raghavachari, M., Xia, C., Zhang, L.: A smart hill-climbing algorithm for application server configuration. In: Proceedings of the 13th international conference on world wide web, pp. 287\u2013296 (2004)","DOI":"10.1145\/988672.988711"},{"key":"23_CR7","first-page":"1","volume":"46","author":"P. Hertel","year":"2007","unstructured":"Hertel, P., Pitassi, T.: An exponential time\/space speedup for resolution. Electronic Colloquium on Computational Complexity\u00a046, 1\u201325 (2007)","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"23_CR8","unstructured":"Allen, D., Darwiche, A.: Optimal time-space tradeoff in probabilistic inference. In: Proceedings of the 21st international joint conference on artificial intelligence, pp. 969\u2013975 (2003)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Ganapathy, G., Ramachandran, V., Warnow, T.: Better hill-climbing searches for parsimony. Algorithms in Bioinformatics, 245\u2013258 (2004)","DOI":"10.1007\/978-3-540-39763-2_19"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization, 215\u2013310 (1997)","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"23_CR11","volume-title":"The traveling salesman problem: A computational study","author":"D.L. Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Vasek, C., Cook, W.J.: The traveling salesman problem: A computational study. Princeton University Press, Princeton (2007)"},{"issue":"3","key":"23_CR12","first-page":"73","volume":"17","author":"S. Zilberstein","year":"1996","unstructured":"Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Magazine\u00a017(3), 73\u201383 (1996)","journal-title":"AI Magazine"},{"key":"23_CR13","unstructured":"McMahan, H., Gordon, G.: A fast bundle-based anytime algorithm for poker and other convex games. In: Proceedings of the 11th international conference on artificial intelligence and statistics, pp. 323\u2013330 (2007)"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ijar.2004.04.001","volume":"38","author":"T. Ramos","year":"2005","unstructured":"Ramos, T., Cozman, G.: Anytime anyspace probabilistic inference. International Journal of Approximate Reasoning\u00a038(1), 53\u201380 (2005)","journal-title":"International Journal of Approximate Reasoning"},{"key":"23_CR15","volume-title":"High-performance computer architecture","author":"H.S. Stone","year":"1993","unstructured":"Stone, H.S.: High-performance computer architecture. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Vanichpun, S., Malkowski, A.M.: Comparing strength of locality of reference \u2013 popularity, majorization, and some folk theorems. In: 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 838\u2013839 (2004)","DOI":"10.1109\/INFCOM.2004.1356972"}],"container-title":["Lecture Notes in Computer Science","Next-Generation Applied Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02568-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T10:31:11Z","timestamp":1739183471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02568-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642025679","9783642025686"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02568-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}