Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem

References

• Altman E.Constrained Markov Decision Processes (1999) (Chapman and Hall/CRC, Boca Raton, FL) Google Scholar
• Andramonov M., Filar J. A., Rubinov A., Pardalos P., Pardalos P. Hamiltonian cycle problem via Markov chains and min-type approaches. Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (2000) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Bondy J. A., Murty U. S. R.Graph Theory with Applications (1976) (North-Holland, New York) Crossref, Google Scholar
• Denardo E. V., Feinberg E. A., Rothblum U. G. On occupation measures for total-reward MDPs. 47th IEEE Conf. Decision and Control (2008) (IEEE, Cancun, Mexico) 4460–4465Crossref, Google Scholar
• Ejov V., Filar J. A., Gondzio J. An interior point heuristic for the Hamiltonian cycle problem via Markov decision processes. J. Global Optim. (2004) 29(3):315–334Crossref, Google Scholar
• Eshragh A., Filar J. A., Haythorpe M.A Hybrid Simulation-Optimization Algorithm for the Hamiltonian Cycle Problem (2009) (Springer, Dordrecht, The Netherlands) Google Scholar
• Feinberg E. Constrained discounted Markov decision process and Hamiltonian cycles. Math. Oper. Res. (2000) 25(1):130–140Link, Google Scholar
• Feinberg E., Shwartz A. Constrained discounted dynamic programming. Math. Oper. Res. (1996) 21:922–945Link, Google Scholar
• Filar J. A. Controlled Markov chains, graphs, and Hamiltonicity. Foundations Trends Stochastic Systems (2007) 1(2):77–162Crossref, Google Scholar
• Filar J. A., Krass D. Hamiltonian cycles and Markov chains. Math. Oper. Res. (1994) 19:223–237Link, Google Scholar
• Filar J. A., Lasserre J.-B. A non-standard branch and bound method for the Hamiltonian cycle problem. ANZIAM J. (2000) 42(E):556–577Google Scholar
• Filar J. A., Vrieze K.Competitive Markov Decision Processes (1996) (Springer-Verlag, New York) Crossref, Google Scholar
• Gross J., Yellen J.Graph Theory and Its Application (2005) (CRC Press, Boca Raton, FL) Google Scholar
• Hordijk A., Kallenberg L. C. M. Constrained undiscounted stochastic dynamic programming. Math. Oper. Res. (1984) 9(2):276–289Link, Google Scholar
• Meringer M. Fast generation of regular graphs and construction of cages. J. Graph Theory (1999) 30:137–146Crossref, Google Scholar
• Nguyen G. T. Hamiltonian cycle problem, Markov decision processes and graph spectra. (2009) . Ph.D. thesis, University of South Australia, AdelaideGoogle Scholar
• Tucker A.Applied Combinatorics (1980) (John Wiley & Sons, New York) Google Scholar