{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:58:14Z","timestamp":1761807494173,"version":"3.37.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,5,21]],"date-time":"2009-05-21T00:00:00Z","timestamp":1242864000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10479-009-0565-9","type":"journal-article","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T10:23:32Z","timestamp":1242815012000},"page":"103-125","source":"Crossref","is-referenced-by-count":13,"title":["A hybrid simulation-optimization algorithm for\u00a0the\u00a0Hamiltonian\u00a0cycle\u00a0problem"],"prefix":"10.1007","volume":"189","author":[{"given":"Ali","family":"Eshragh","sequence":"first","affiliation":[]},{"given":"Jerzy A.","family":"Filar","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Haythorpe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,21]]},"reference":[{"key":"565_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.2517-6161.1966.tb00626.x","volume":"28","author":"S. M. Ali","year":"1966","unstructured":"Ali, S. M., & Silvey, S. D. (1966). A general class of coefficients of divergence of one distribution from another. Journal of the Royal Statistical Society,\u00a0B, 28, 131\u2013142.","journal-title":"Journal of the Royal Statistical Society,\u00a0B"},{"key":"565_CR2","volume-title":"The traveling salesman problem: a computational study","author":"D. L. Applegate","year":"2007","unstructured":"Applegate, D. L., Bixby, R. E., Chvatal, V., & Cook, W. J. (2007). The traveling salesman problem: a computational study. Princeton: Princeton University Press."},{"issue":"4","key":"565_CR3","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s11009-008-9073-7","volume":"10","author":"Z. I. Botev","year":"2008","unstructured":"Botev, Z. I., & Kroese, D. P. (2008). An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting. Methodology and Computing in Applied Probability, 10(4), 471\u2013505.","journal-title":"Methodology and Computing in Applied Probability"},{"issue":"5","key":"565_CR4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.orl.2006.11.005","volume":"35","author":"A. Costa","year":"2007","unstructured":"Costa, A., Jones, O. D., & Kroese, D. (2007). Convergence properties of the cross-entropy method for discrete optimization. Operations Research Letters, 35(5), 573\u2013580.","journal-title":"Operations Research Letters"},{"key":"565_CR5","unstructured":"The Cross-Entropy Method (2009). http:\/\/www.cemethod.org\/ . Accessed 11\u00a0Feb 2009."},{"issue":"3","key":"565_CR6","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1137\/070693898","volume":"22","author":"V. Ejov","year":"2008","unstructured":"Ejov, V., Filar, J. A., Murray, W., & Nguyen, G. T. (2008a). Determinants and longest cycles of graphs. SIAM Journal of Discrete Mathematics, 22(3), 1215\u20131225.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"565_CR7","doi-asserted-by":"crossref","unstructured":"Ejov, V., Filar, J., Haythorpe, M., & Nguyen, G. (2008b). Refined MDP-based branch-and-bound algorithm for the Hamiltonian cycles problem. Mathematics of Operations Research (to\u00a0appear).","DOI":"10.1287\/moor.1090.0398"},{"key":"565_CR8","unstructured":"Eshragh, A., & Modarres, M. (2009). A new approach to distribution fitting: decision on beliefs. Journal of Industrial and Systems Engineering (to\u00a0appear)."},{"key":"565_CR9","unstructured":"Eshragh Jahromi, A., & Akhavan Niaki, S. T. (2003). Application of decision on beliefs in response surface methodology. In Proceeding of the 54th session of international statistical institute, Berlin, Germany, 2003."},{"issue":"1","key":"565_CR10","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. (2000). Constrained discounted Markov decision processes and Hamiltonian cycles. Mathematics of Operations Research, 25(1), 130\u2013140.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"565_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1561\/0900000003","volume":"1","author":"J. A. Filar","year":"2006","unstructured":"Filar, J. A. (2006). Controlled Markov chains, graphs & Hamiltonicity. Foundation and Trends\u00ae in Stochastic Systems, 1(2), 77\u2013162.","journal-title":"Foundation and Trends\u00ae in Stochastic Systems"},{"issue":"1","key":"565_CR12","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. (1994). Hamiltonian cycles and Markov chains. Mathematics of Operations Research, 19(1), 223\u2013237.","journal-title":"Mathematics of Operations Research"},{"key":"565_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4054-9","volume-title":"Competitive Markov decision processes","author":"J. A. Filar","year":"1996","unstructured":"Filar, J. A., & Vrieze, K. (1996). Competitive Markov decision processes (1st\u00a0edn.). Berlin: Springer.","edition":"1"},{"key":"565_CR14","volume-title":"Random number generation and Monte Carlo methods","author":"J. E. Gentle","year":"2004","unstructured":"Gentle, J. E. (2004). Random number generation and Monte Carlo methods (2nd\u00a0edn.). Berlin: Springer.","edition":"2"},{"key":"565_CR15","volume-title":"Linear and nonlinear programming","author":"D. G. Luenberger","year":"2003","unstructured":"Luenberger, D. G. (2003). Linear and nonlinear programming (2nd\u00a0edn.). Dordrecht: Kluwer Academic Publishers.","edition":"2"},{"key":"565_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10479-005-5731-0","volume":"134","author":"L. Margolin","year":"2005","unstructured":"Margolin, L. (2005). On the convergence of the cross-entropy method. Annals of Operations Research, 134, 201\u2013214.","journal-title":"Annals of Operations Research"},{"key":"565_CR17","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"M. L. Puterman","year":"2005","unstructured":"Puterman, M. L. (2005). Markov decision processes: discrete stochastic dynamic programming (1st\u00a0edn.). New York: Wiley-Interscience.","edition":"1"},{"key":"565_CR18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-2217(96)00385-2","volume":"99","author":"R. Y. Rubinstein","year":"1997","unstructured":"Rubinstein, R. Y. (1997). Optimization of computer simulation models with rare events. European Journal of Operational Research, 99, 89\u2013112.","journal-title":"European Journal of Operational Research"},{"key":"565_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1010091220143","volume":"2","author":"R. Y. Rubinstein","year":"1999","unstructured":"Rubinstein, R. Y. (1999). The cross-entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability, 2, 127\u2013190.","journal-title":"Methodology and Computing in Applied Probability"},{"key":"565_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The cross-entropy method: a\u00a0unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning","author":"R. Y. Rubinstein","year":"2004","unstructured":"Rubinstein, R. Y., & Kroese, D. P. (2004). The cross-entropy method: a\u00a0unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning. Berlin: Springer."},{"key":"565_CR21","unstructured":"Vaisman, R. (2009). TSP Random tour generation algorithm. http:\/\/iew3.technion.ac.il\/CE\/pubs.php . Accessed 11\u00a0Feb 2009."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0565-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0565-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0565-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T16:13:24Z","timestamp":1739117604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0565-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,21]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["565"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0565-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2009,5,21]]}}}