Hamiltonian Cycle Problem via Markov Chains and Min-type Approaches

  • Mikhail Andramonov
  • Jerzy Filar
  • Panos Pardalos
  • Alexander Rubinov
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 42)


Given a directed graph and a given starting node, the Hamiltonian Cycle Problem (HCP) is to find a path that visits every other node exactly once before returning to the starting node. In this paper we solve the HCP via Markov chains and min-type functions. In addition, we present preliminary computational results with randomly generated graphs of moderate size.


Hamiltonian Cycle Problem Markov Chains Minimax Optimization. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Yu. Andramonov, A. M. Rubinov and B. M. Glover, Cutting angle methods in global optimization, Applied Mathematics Letters,to appear.Google Scholar
  2. [2]
    E. Balas, Disjunctive programming, Annals of Discrete Mathematics 5, 1979, 3–51.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    C. Derman, Finite State Markovian Decision Processes, Academic Press, New York, 1970.zbMATHGoogle Scholar
  4. [4]
    J. A. Filar and D. Krass, Hamiltonian cycles and Markov chains, Mathematics of Operations Research,19, 1995, No. 1, 223–237.MathSciNetGoogle Scholar
  5. [5]
    Ming Chen and J. A. Filar, Hamiltonian Cycles, Qudratic Programming, and Ranking of Extreme Points. In C. Floudas and P. Pardalos, editors, Global Optimization. Princeton University Press, 1992.Google Scholar
  6. [6]
    J. A. Filar and Ke Liu, Hamilton Cycle Problem and Singularly Perturbed Markov Decision Process, Research Report 1996/1, University of South Australia, School of Mathematics.Google Scholar
  7. [7]
    J. A. Filar, M. G. M. Oberije and P. M. Pardalos, Hamiltonian Cycle Problem, Controlled Markov Chains and Quadratic Programming, In The Proceedings of The 12th National Conference of The Australian Society For Operations Research (Adelaide July 7–9), 1993, pp. 263–281.Google Scholar
  8. [8]
    R. Horst and P. Pardalos (eds) Handbook on Global Optimization, Kluwer Academic Publishers, 1996.Google Scholar
  9. [9]
    L. C. M. Kallenberg, Linear Programming and Finite Markovian Control Problems, volume 148 of Mathematical Center Tracts, Amsterdam, 1983.Google Scholar
  10. [10]
    S. S. Kutateladze and A. M. Rubinov, Minkowski Duality and its Applications, Nauka, Novosibirsk, 1976Google Scholar
  11. [11]
    E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, The Tray-ding Salesman Problem. A Guided Tour of Combinatorial optimization, Wiley, Chichester, 1985.Google Scholar
  12. [12]
    D. Pallaschke and S. Rolewicz, Foundations of Mathematical Optimization, Kluwer Academic Publishers, 1997.Google Scholar
  13. [13]
    C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, New Jersey, 1982.zbMATHGoogle Scholar
  14. [14]
    A.M. Rubinov and M. Yu.Andramonov, Minimizing increasing star-shaped functions based on abstract convexity, Journal of Global Optimization,to appear.Google Scholar
  15. [15]
    A. Rubinov and M. Andramonov, Lipschitz programming via increasing convexalong-rays functions, Optimization Methods and Software,to appear.Google Scholar
  16. [16]
    A. M. Rubinov and B. M. Glover, Increasing convex along-rays-functions with applications to global optimization, Journal of Optimization Theory and Applications,to appear.Google Scholar
  17. [17]
    I. Singer, Abstract Convex Analysis, Wiley and Sons, 1997.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Mikhail Andramonov
    • 1
  • Jerzy Filar
    • 2
  • Panos Pardalos
    • 3
  • Alexander Rubinov
    • 1
  1. 1.School of Information Technology and Mathematical SciencesUniversity of BallaratVictoriaAustralia
  2. 2.School of MathematicsUniversity of South AustraliaThe LevelsAustralia
  3. 3.Center for Applied Optimization and ISE DepartmentUniversity of FloridaGainesvilleUSA

Personalised recommendations