Abstract
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.
Partly supported by the Australian Research Council
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Yu. Andramonov, A. M. Rubinov and B. M. Glover, Cutting angle methods in global optimization, Applied Mathematics Letters,to appear.
E. Balas, Disjunctive programming, Annals of Discrete Mathematics 5, 1979, 3–51.
C. Derman, Finite State Markovian Decision Processes, Academic Press, New York, 1970.
J. A. Filar and D. Krass, Hamiltonian cycles and Markov chains, Mathematics of Operations Research,19, 1995, No. 1, 223–237.
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.
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.
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.
R. Horst and P. Pardalos (eds) Handbook on Global Optimization, Kluwer Academic Publishers, 1996.
L. C. M. Kallenberg, Linear Programming and Finite Markovian Control Problems, volume 148 of Mathematical Center Tracts, Amsterdam, 1983.
S. S. Kutateladze and A. M. Rubinov, Minkowski Duality and its Applications, Nauka, Novosibirsk, 1976
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.
D. Pallaschke and S. Rolewicz, Foundations of Mathematical Optimization, Kluwer Academic Publishers, 1997.
C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, New Jersey, 1982.
A.M. Rubinov and M. Yu.Andramonov, Minimizing increasing star-shaped functions based on abstract convexity, Journal of Global Optimization,to appear.
A. Rubinov and M. Andramonov, Lipschitz programming via increasing convexalong-rays functions, Optimization Methods and Software,to appear.
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.
I. Singer, Abstract Convex Analysis, Wiley and Sons, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Andramonov, M., Filar, J., Pardalos, P., Rubinov, A. (2000). Hamiltonian Cycle Problem via Markov Chains and Min-type Approaches. In: Pardalos, P.M. (eds) Approximation and Complexity in Numerical Optimization. Nonconvex Optimization and Its Applications, vol 42. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3145-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3145-3_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4829-8
Online ISBN: 978-1-4757-3145-3
eBook Packages: Springer Book Archive