{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:06Z","timestamp":1740122766915,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T00:00:00Z","timestamp":1636156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T00:00:00Z","timestamp":1636156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DDM-8715153"],"award-info":[{"award-number":["DDM-8715153"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-90-J-1242"],"award-info":[{"award-number":["N00014-90-J-1242"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10589-021-00326-y","type":"journal-article","created":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T04:21:18Z","timestamp":1636172478000},"page":"309-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8143-6583","authenticated-orcid":false,"given":"Michael","family":"Haythorpe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Murray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,6]]},"reference":[{"key":"326_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.B., Chav\u00e1tal, V., WJ, Cook: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"issue":"1","key":"326_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s12532-013-0059-2","volume":"6","author":"P Baniasadi","year":"2014","unstructured":"Baniasadi, P., Ejov, V., Filar, J.A., Haythorpe, M., Rossomakhine, S.: Deterministic, \u201cSnakes and Ladders\u2019\u2019 Heuristic for the Hamiltonian cycle problem. Math. Prog. Comput. 6(1), 55\u201374 (2014)","journal-title":"Math. Prog. Comput."},{"key":"326_CR3","unstructured":"Bonami, P., Forret, J.J.H., Laird, C., Lee, J., Margot, F., W\u00e4chter, A.: BONMIN: basic open-source nonlinear mixed integer programming (2006), http:\/\/www.coin-or.org\/Bonmin"},{"key":"326_CR4","unstructured":"Bonami, P., Lee, J.: BONMIN user\u2019s manual, (2006) https:\/\/svn.coin-or.org\/svn\/Bonmin\/releases\/0.1.4\/Bonmin\/doc\/BONMIN_UsersManual.pdf"},{"key":"326_CR5","unstructured":"Chalaturnyk, A.: A fast algorithm for finding Hamilton cycles. Master Thesis, University of Manitoba (2008)"},{"issue":"3","key":"326_CR6","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1137\/070693898","volume":"22","author":"V Ejov","year":"2009","unstructured":"Ejov, V., Filar, J.A., Murray, W., Nguyen, G.T.: Determinants and longest cycles of graphs. SIAM J. Discrete Math. 22(3), 1215\u20131225 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"326_CR7","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: The traveling salesman problem for cubic graphs. In: Workshop on Algorithms and Data Structures. Springer, Berlin, Heidelberg (2003)","DOI":"10.1007\/978-3-540-45078-8_27"},{"issue":"1","key":"326_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10479-009-0565-9","volume":"189","author":"A Eshragh","year":"2011","unstructured":"Eshragh, A., Filar, J.A., Haythorpe, M.: A hybrid simulation\u2013optimization algorithm for the Hamiltonian cycle problem. Ann. Oper. Res. 189(1), 103\u2013125 (2011)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"326_CR9","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1007\/s10898-012-9855-x","volume":"56","author":"JA Filar","year":"2013","unstructured":"Filar, J.A., Haythorpe, M., Murray, W.: On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph. J. Glob. Optim. 56(4), 1425\u20131440 (2013)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"326_CR10","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0614040","volume":"14","author":"A Forsgren","year":"1993","unstructured":"Forsgren, A., Murray, W.: Newton methods for large-scale linear equality-constrained minimization. SIAM J. Matrix Anal. Appl. 14(2), 560\u2013587 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"326_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01585529","volume":"7","author":"PE Gill","year":"1974","unstructured":"Gill, P.E., Murray, W.: Newton-type methods for unconstrained and linearly constrained optimization. Math. Program. 7(1), 311\u2013350 (1974)","journal-title":"Math. Program."},{"key":"326_CR12","volume-title":"Practical Optimization","author":"PE Gill","year":"1981","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic Press, London (1981)"},{"key":"326_CR13","unstructured":"Haythorpe, M.: Markov Chain Based Algorithms for the Hamiltonian Cycle Problem. PhD Thesis, University of South Australia (2010)"},{"key":"326_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of Lin\u2013Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"326_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Springer US (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"326_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10589-008-9218-1","volume":"47","author":"W Murray","year":"2010","unstructured":"Murray, W., Ng, K.-M.: An algorithm for nonlinear optimization problems with binary variables. Comput. Optim. Appl. 47(2), 257\u2013288 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"326_CR17","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"key":"326_CR18","unstructured":"OPTI Toolbox 2.16. http:\/\/www.i2c2.aut.ac.nz\/Wiki\/OPTI (2015)"},{"key":"326_CR19","doi-asserted-by":"crossref","unstructured":"Ponceleon, D.: Barrier methods for large-scale quadratic programming. No. SOL-91-2. Stanford University CA Systems Optimization Laboratory (1991)","DOI":"10.21236\/ADA238554"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00326-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00326-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00326-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T18:30:08Z","timestamp":1641407408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00326-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,6]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["326"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00326-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,11,6]]},"assertion":[{"value":"22 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}