{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T22:21:21Z","timestamp":1758406881961,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,14]],"date-time":"2015-10-14T00:00:00Z","timestamp":1444780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,10,14]],"date-time":"2015-10-14T00:00:00Z","timestamp":1444780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP120100532"],"award-info":[{"award-number":["DP120100532"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10479-015-2030-2","type":"journal-article","created":{"date-parts":[[2015,10,14]],"date-time":"2015-10-14T21:25:40Z","timestamp":1444857940000},"page":"605-622","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hamiltonian cycle curves in the space of discounted occupational measures"],"prefix":"10.1007","volume":"317","author":[{"given":"Jerzy A.","family":"Filar","sequence":"first","affiliation":[]},{"given":"Asghar","family":"Moeini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,14]]},"reference":[{"key":"2030_CR1","doi-asserted-by":"publisher","unstructured":"Avrachenkov, K., Eshragh, A., & Filar, J. A. (2014). On transition matrices of Markov chains corresponding to Hamiltonian cycles. Annals of Operations Research. doi:10.1007\/s10479-014-1642-2.","DOI":"10.1007\/s10479-014-1642-2"},{"key":"2030_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. (2014). Deterministic Snakes and Ladders Heuristic for the Hamiltonian cycle problem. Mathematical Programming Computation, 6, 55\u201375.","journal-title":"Mathematical Programming Computation"},{"issue":"4","key":"2030_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02579321","volume":"7","author":"B Bollobas","year":"1987","unstructured":"Bollobas, B., Fenner, T., & Frieze, A. (1987). An algorithm for finding Hamiltonian paths and cycles in random graphs. Combinatorica, 7(4), 327\u2013341.","journal-title":"Combinatorica"},{"key":"2030_CR4","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1002\/rsa.20034","volume":"25","author":"V Borkar","year":"2004","unstructured":"Borkar, V., Ejov, V., & Filar, J. A. (2004). Directed graphs, Hamiltonicity and doubly stochastic matrices. Random Structures and Algorithms, 25, 376\u2013395.","journal-title":"Random Structures and Algorithms"},{"key":"2030_CR5","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/rsa.20237","volume":"34","author":"V Borkar","year":"2009","unstructured":"Borkar, V., Ejov, V., & Filar, J. A. (2009). On the Hamiltonicity gap in directed graphs. Random Structures and Algorithms, 34, 502\u2013519.","journal-title":"Random Structures and Algorithms"},{"issue":"3","key":"2030_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/rsa.3240050303","volume":"5","author":"A Broder","year":"1994","unstructured":"Broder, A., Frieze, A., & Shamir, E. (1994). Finding hidden Hamiltonian cycles. Random Structures and Algorithms, 5(3), 395\u2013410.","journal-title":"Random Structures and Algorithms"},{"key":"2030_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(88)90357-8","volume":"34","author":"F Brunacci","year":"1988","unstructured":"Brunacci, F. (1988). Two useful tools for constructing Hamiltonian circuits. EJOR, 34, 231\u2013236.","journal-title":"EJOR"},{"key":"2030_CR8","volume-title":"Graph theory: An algorithmic approach","author":"N Christofides","year":"1975","unstructured":"Christofides, N. (1975). Graph theory: An algorithmic approach. New York: Academic Press."},{"issue":"3","key":"2030_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/B:JOGO.0000044772.11089.1a","volume":"29","author":"V Ejov","year":"2004","unstructured":"Ejov, V., Filar, J. A., & Gondzio, J. (2004b). An interior point heuristic algorithm for the HCP. Journal of Global Optimization, 29(3), 315\u2013334.","journal-title":"Journal of Global Optimization"},{"key":"2030_CR10","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/moor.1090.0398","volume":"34","author":"V Ejov","year":"2009","unstructured":"Ejov, V., Filar, J. A., Haythorpe, M., & Nguyen, G. T. (2009). Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem. Mathematics of Operations Research, 34, 758\u2013768.","journal-title":"Mathematics of Operations Research"},{"key":"2030_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.jmaa.2006.09.072","volume":"333","author":"V Ejov","year":"2007","unstructured":"Ejov, V., Filar, J. A., Lucas, S. K., & Zograf, P. (2007). Clustering of spectra and fractals of regular graphs. Journal of Mathematical Analysis and Applications, 333, 236\u2013246.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"2030_CR12","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1137\/070693898","volume":"22","author":"V Ejov","year":"2008","unstructured":"Ejov, V., Filar, J. A., Murray, W., & Nguyen, G. (2008). Determinants and Longest cycles of graph. SIAM Journal on Discrete Mathematics, 22, 1215\u20131225.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"2030_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/moor.1030.0066","volume":"29","author":"V Ejov","year":"2004","unstructured":"Ejov, V., Filar, J. A., & Nguyen, M. (2004a). Hamiltonian cycles and singularly perturbed Markov chains. Mathematics of Operations Research, 29(1), 114\u2013131.","journal-title":"Mathematics of Operations Research"},{"issue":"8","key":"2030_CR14","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1016\/j.laa.2009.05.019","volume":"431","author":"V Ejov","year":"2009","unstructured":"Ejov, V., Friedland, S., & Nguyen, G. (2009). A note on the graph\u2019s resolvent and the multifilar structure. Linear Algebra and its Applications, 431(8), 1367\u20131379.","journal-title":"Linear Algebra and its Applications"},{"issue":"4","key":"2030_CR15","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1017\/S0021900200008512","volume":"48","author":"V Ejov","year":"2011","unstructured":"Ejov, V., Litvak, N., Nguyen, G. T., & Taylor, P. G. (2011). Proof of the Hamiltonicity-trace conjecture for singularly perturbed Markov chains. Journal of Applied Probability, 48(4), 901\u2013910.","journal-title":"Journal of Applied Probability"},{"issue":"2","key":"2030_CR16","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/moor.1110.0492","volume":"36","author":"A Eshragh","year":"2011","unstructured":"Eshragh, A., & Filar, J. A. (2011). Hamiltonian cycles, random walks and discounted occupational measures. Mathematics of Operations Research, 36(2), 258\u2013270.","journal-title":"Mathematics of Operations Research"},{"key":"2030_CR17","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/moor.25.1.130.15210","volume":"25","author":"E Feinberg","year":"2000","unstructured":"Feinberg, E. (2000). Constrained discounted Markov decision process with Hamiltonian cycles. Mathematics of Operations Research, 25, 130\u2013140.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"2030_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0900000003","volume":"1","author":"JA Filar","year":"2006","unstructured":"Filar, J. A. (2006). Controlled Markov chains, graphs and Hamiltonicity. Foundations and Trends in Stochastic Systems, 1(2), 1\u201381.","journal-title":"Foundations and Trends in Stochastic Systems"},{"key":"2030_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1287\/moor.19.1.223","volume":"19","author":"JA Filar","year":"1994","unstructured":"Filar, J. A., & Krass, D. (1994). Hamiltonian cycles and Markov chains. Mathematics of Operations Research, 19, 223\u2013237.","journal-title":"Mathematics of Operations Research"},{"issue":"E","key":"2030_CR20","first-page":"C556","volume":"42","author":"JA Filar","year":"2000","unstructured":"Filar, J. A., & Lasserre, J.-B. (2000). A non-standard branch and bound method for the Hamiltonian cycle problem. ANZIAM Journal, 42(E), C556\u2013C577.","journal-title":"ANZIAM Journal"},{"issue":"1\u20132","key":"2030_CR21","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, D., & Tarjan, R. (1976). The planar Hamiltonian circuit problem is NP-complete. SIAM Journal on Computing, 5(1\u20132), 704\u2013714.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"2030_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"R Karp","year":"1977","unstructured":"Karp, R. (1977). Probabilistic analysis of partitioning algorithms for the travelling-salesman problem in the plane. Mathematics of Operations Research, 2(3), 209\u2013224.","journal-title":"Mathematics of Operations Research"},{"key":"2030_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(92)90601-B","volume":"101","author":"W Kocay","year":"1992","unstructured":"Kocay, W. (1992). An extension of the multi-path algorithm for finding Hamiltonian cycles. Discrete Mathematics, 101, 171\u2013188.","journal-title":"Discrete Mathematics"},{"key":"2030_CR24","first-page":"169","volume":"45","author":"W Kocay","year":"1994","unstructured":"Kocay, W., & Li, P.-C. (1994). An algorithm for finding a long path in a graph. Utilitas Mathematica, 45, 169\u2013185.","journal-title":"Utilitas Mathematica"},{"issue":"1","key":"2030_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/moor.1080.0351","volume":"34","author":"N Litvak","year":"2009","unstructured":"Litvak, N., & Ejov, V. (2009). Markov chains and optimality of the Hamiltonian cycle. Mathematics of Operations Research, 34(1), 71\u201382.","journal-title":"Mathematics of Operations Research"},{"key":"2030_CR26","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(96)00010-8","volume":"73","author":"I Parberry","year":"1997","unstructured":"Parberry, I. (1997). An efficient algorithm for the Knight\u2019s tour problem. Discrete Applied Mathematics, 73, 251\u2013260.","journal-title":"Discrete Applied Mathematics"},{"key":"2030_CR27","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"L Posa","year":"1976","unstructured":"Posa, L. (1976). Hamiltonian circuits in random graphs. Discrete Mathematics, 14, 359\u2013364.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"2030_CR28","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1002\/rsa.3240050209","volume":"5","author":"R Robinson","year":"1994","unstructured":"Robinson, R., & Wormald, N. (1994). Almost all regular graphs are Hamiltonian. Random Structures and Algorithms, 5(2), 363\u2013374.","journal-title":"Random Structures and Algorithms"},{"key":"2030_CR29","volume-title":"Standard mathematical tables and formulae","year":"1996","unstructured":"Zwillinger, D. (Ed.). (1996). Standard mathematical tables and formulae (30th ed.). Boca Raton, Florida: CRC Press.","edition":"30"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2030-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-015-2030-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2030-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2030-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T13:41:58Z","timestamp":1667310118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-015-2030-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,14]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2030"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2030-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2015,10,14]]},"assertion":[{"value":"14 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}