{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:47:04Z","timestamp":1725979624191},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319899190"},{"type":"electronic","value":"9783319899206"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89920-6_26","type":"book-chapter","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T16:59:40Z","timestamp":1527267580000},"page":"185-190","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Closed Almost Knight\u2019s Tours on 2D and 3D Chessboards"],"prefix":"10.1007","author":[{"given":"Michael","family":"Firstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anja","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,26]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0166-218X(92)00170-Q","volume":"50","author":"A Conrad","year":"1994","unstructured":"Conrad, A., Hindrichs, T., Hussein, M., & Wegener, I. (1994). Solution of the knight\u2019s Hamiltonian path problem on chessboards. Discrete Applied Mathematics, 50(2), 125\u2013134.","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR2","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Operations Research, 2, 393\u2013410.","journal-title":"Operations Research"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"DeMaio, J., & Mathew, B. (2011). Which chessboards have a closed knight\u2019s tour within the rectangular prism?. The Electronic Journal of Combinatorics18.","DOI":"10.37236\/495"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Erde, J.,\u00a0Gol\u00e9nia, B.,\u00a0Gol\u00e9nia, S. (2012). The closed knight tour problem in higher dimensions. The Electronic Journal of Combinatorics, 16(4).","DOI":"10.37236\/2272"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s10878-017-0119-z","volume":"34","author":"Anja Fischer","year":"2017","unstructured":"Fischer, A., & Hungerl\u00e4nder, P. (2017). The traveling salesman problem on grids with forbidden neighborhoods. Journal of Combinatorial Optimization.","journal-title":"Journal of Combinatorial Optimization"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2004.11.002","volume":"146","author":"S Lin","year":"2005","unstructured":"Lin, S., & Wei, C. (2005). Optimal algorithms for constructing knight\u2019s tours on arbitrary $$n \\times m $$ chessboards. Discrete Applied Mathematics, 146, 219\u2013232.","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"26_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1080\/0025570X.1991.11977627","volume":"64","author":"AJ Schwenk","year":"1991","unstructured":"Schwenk, A. J. (1991). Which rectangular chessboards have a knight\u2019s tour? Mathematics Magazine, 64(5), 325\u2013332.","journal-title":"Mathematics Magazine"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89920-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T14:06:32Z","timestamp":1604325992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89920-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319899190","9783319899206"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89920-6_26","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2018]]}}}