{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T20:57:13Z","timestamp":1781729833830,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540413486","type":"print"},{"value":"9783540444114","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_2","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:52:31Z","timestamp":1182207151000},"page":"18-35","source":"Crossref","is-referenced-by-count":48,"title":["Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power"],"prefix":"10.1007","author":[{"given":"J\u00fcrg","family":"Nievergelt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"K. Appel and W. Haken. The Solution of the Four-Color-Map Problem. Scientific American, pages 108\u2013121, October 1977. 34","DOI":"10.1038\/scientificamerican1077-108"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"D. Avis and K. Fukuda. Reverse Search for Enumeration. Discrete Apllied Mathematics, 65:21\u201346, 1996. 25, 31, 32","journal-title":"Discrete Apllied Mathematics"},{"key":"2_CR3","unstructured":"A Bruengger. Solving hard combinatorial optimization problems in parallel. Two case studies. PhD thesis, ETH Zurich, 1997. 34"},{"key":"2_CR4","unstructured":"R. Gasser. Harnessing computational resources for efficient exhaustive search. PhD thesis, ETH Zurich, 1995. 34"},{"key":"2_CR5","unstructured":"J. Horgan. The Death of Proof. Scientific American, pages 74\u201382, 1993. 34"},{"key":"2_CR6","unstructured":"D. H. Lehmer. The machine tools of combinatorics. In E. F. Beckenbach, editor, Applied combinatorial mathematics, chapter 1, pages 5\u201331. Wiley, NY, edition, 1964. 34"},{"key":"2_CR7","unstructured":"A Marzetta. ZRAM: A library of parallel search algorithms and its use in enumeration and combinatorial optimization. PhD thesis, ETH Zurich, 1998. 34"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"A. Marzetta and J. Nievergelt. Enumerating the k best plane spanning trees. In Computational Geometry\u2014Theory and Application, 2000. To appear. 31","DOI":"10.1016\/S0925-7721(00)00029-8"},{"key":"2_CR9","unstructured":"H. Maurer. Forecasting: An impossible necessity. In Symposium Computer and Information Technology, http:\/\/www.inf.ethz.ch\/latsis2000\/ , Invited Talk. ETH Zurich. 2000. 21"},{"key":"2_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0015248","volume-title":"Computer Science Today","author":"J. Nievergelt","year":"1995","unstructured":"J. Nievergelt, R. Gasser, F. M\u00e4ser, and C. Wirth. All the needles in a haystack: Can exhaustive search overcome combinatorial chaos? In J. van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science LNCS 1000, pages 254\u2013274. Springer, 1995. 35"},{"issue":"3","key":"2_CR11","first-page":"131","volume":"9","author":"K. Thomson","year":"1986","unstructured":"K. Thomson. Retrograde analysis of certain endgames. ICCA J., 9(3):131\u2013139, 1986. 34","journal-title":"ICCA J."},{"key":"2_CR12","unstructured":"H. van Houten. The physical basis of digital computing. In Symposium Computer and Information Technology, http:\/\/www.inf.ethz.ch\/latsis2000\/ , Invited Talk. ETH Zurich. 2000. 19"},{"issue":"2","key":"2_CR13","first-page":"67","volume":"22","author":"C. Wirth","year":"1999","unstructured":"C. Wirth and J. Nievergelt. Exhaustive and heuristic retrograde analysis of the KPPKP endgame. ICCA J., 22(2):67\u201381, 1999 34","journal-title":"ICCA J."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T11:57:10Z","timestamp":1683892630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}