{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T19:42:40Z","timestamp":1758397360824},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,11,23]],"date-time":"2011-11-23T00:00:00Z","timestamp":1322006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10898-011-9819-6","type":"journal-article","created":{"date-parts":[[2011,11,22]],"date-time":"2011-11-22T10:48:09Z","timestamp":1321958889000},"page":"633-639","source":"Crossref","is-referenced-by-count":3,"title":["Markov chains, Hamiltonian cycles and volumes of convex bodies"],"prefix":"10.1007","volume":"55","author":[{"given":"Vivek S.","family":"Borkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy A.","family":"Filar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,23]]},"reference":[{"key":"9819_CR1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1287\/opre.1060.0291","volume":"54","author":"T.P.I. Ahamed","year":"2006","unstructured":"Ahamed T.P.I., Borkar V.S., Juneja S.K.: Adaptive importance sampling technique for Markov chains using stochastic approximation. Oper. Res. 54, 489\u2013504 (2006)","journal-title":"Oper. Res."},{"key":"9819_CR2","volume-title":"Constrained Markov Decision Processes","author":"E. Altman","year":"1999","unstructured":"Altman E.: Constrained Markov Decision Processes. Chapman and Hall, Boca Raton (1999)"},{"key":"9819_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-1-4757-3145-3_3","volume-title":"Approximation and Complexity in Numerical Optimization","author":"M. Andramonov","year":"2000","unstructured":"Andramonov M., Filar J.A., Pardalos P.M., Rubinov A.: Hamiltonian cycle problem via Markov chains and min-type approaches. In: Pardalos, P.M. (eds) Approximation and Complexity in Numerical Optimization, pp. 31\u201347. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"9819_CR4","volume-title":"Handbook of Markov Decision Proceses","author":"V.S. Borkar","year":"2000","unstructured":"Borkar V.S.: Convex analytic approach to Markov decision processes. In: Shwartz, A., Feinberg, E. (eds.) Handbook of Markov Decision Proceses, Kluwer Academic, Boston (2000)"},{"key":"9819_CR5","doi-asserted-by":"crossref","unstructured":"Denardo, E.V., Feinberg, E.A., Rothblum, U.G.: On occupation measures for total-reward MDPs. In: Proceedings of the 47th IEEE Conference on Decision and Control, pp. 4460\u20134465. Cancun, Mexico Dec. 9\u201311 2008","DOI":"10.1109\/CDC.2008.4739426"},{"key":"9819_CR6","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1137\/0217060","volume":"17","author":"M.E. Dyer","year":"1988","unstructured":"Dyer M.E., Frieze A.M.: On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17, 967\u2013974 (1988)","journal-title":"SIAM J. Comput."},{"key":"9819_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M.E. Dyer","year":"1998","unstructured":"Dyer M.E., Frieze A.M., Kannan R.: A random polynomial time algorithm for approximating the volume of convex bodies. J. ACM 38, 1\u201317 (1998)","journal-title":"J. ACM"},{"key":"9819_CR8","doi-asserted-by":"crossref","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.: Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem. Math. Oper. Res. 34, 758\u2013768 (2009)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9819_CR9","doi-asserted-by":"crossref","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.: An interior point heuristic algorithm for the HCP. J. Global Optim. 29(3), 315\u2013334 (2004)","journal-title":"J. Global Optim."},{"key":"9819_CR10","doi-asserted-by":"crossref","unstructured":"Eshragh, A., Filar, J.A., Haythorpe M.: A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem. Ann. Oper. Res. 189, 103\u2013125","DOI":"10.1007\/s10479-009-0565-9"},{"key":"9819_CR11","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/moor.25.1.130.15210","volume":"25","author":"E.A. Feinberg","year":"2000","unstructured":"Feinberg E.A.: Constrained discounted Markov decision processes and Hamiltonian cycles. Math. Oper. Res. 25, 130\u2013140 (2000)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9819_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1561\/0900000003","volume":"1","author":"J.A. Filar","year":"2000","unstructured":"Filar J.A.: Controlled Markov chains, graphs and Hamiltonicity. Found. Trends Stoch. Syst. 1(2), 77\u2013162 (2000)","journal-title":"Found. Trends Stoch. Syst."},{"key":"9819_CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/moor.19.1.223","volume":"19","author":"J.A. Filar","year":"1994","unstructured":"Filar J.A., Krass D.: Hamiltonian cycles and Markov chains. Math. Oper. Res 19, 223\u2013237 (1994)","journal-title":"Math. Oper. Res"},{"key":"9819_CR14","unstructured":"Filar, J.A., Oberije, M., Pardalos, P.M.: Hamiltonian cycle problem, controlled Markov chains and quadratic programming. In: Sutton, D.J. Pearce, C.E.M., Cousins, E.A. (eds.) The Proceedings of the 12th National Conference of the Australian Society for Operations Research, pp. 263\u2013281. Adelaide, July 7\u20139 1993"},{"key":"9819_CR15","unstructured":"Haythorpe, M.: Markov Chain Based Algorithms for the Hamiltonian Cycle Problem. PhD Thesis, University of South Australia, Adelaide (2010)"},{"key":"9819_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8005-3","volume-title":"Counting, Sampling and Integrating: Algorithms and Complexity","author":"M. Jerrum","year":"2003","unstructured":"Jerrum M.: Counting, Sampling and Integrating: Algorithms and Complexity. Birkh\u00e4user, Basel (2003)"},{"key":"9819_CR17","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.jcss.2005.08.004","volume":"72","author":"L. Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz L., Vempala S.: Simulated annealing in convex bodies and an O(n 4) volume algorithm. J. Comput. Syst. Sci. 72, 392\u2013417 (2006)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9819-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9819-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9819-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T19:12:57Z","timestamp":1560971577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9819-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,23]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9819"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9819-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,23]]}}}