IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v317y2022i2d10.1007_s10479-015-2030-2.html
   My bibliography  Save this article

Hamiltonian cycle curves in the space of discounted occupational measures

Author

Listed:
  • Jerzy A. Filar

    (Flinders University)

  • Asghar Moeini

    (Flinders University)

Abstract

We study the embedding of the Hamiltonian Cycle problem, on a symmetric graph, in a discounted Markov decision process. The embedding allows us to explore the space of occupational measures corresponding to that decision process. In this paper we consider a convex combination of a Hamiltonian cycle and its reverse. We show that this convex combination traces out an interesting “H-curve” in the space of occupational measures. Since such an H-curve always exists in Hamiltonian graphs, its properties may help in differentiating between graphs possessing Hamiltonian cycles and those that do not. Our analysis relies on the fact that the resolvent-like matrix induced by our convex combination can be expanded in terms of finitely many powers of probability transition matrices corresponding to that Hamiltonian cycle. We derive closed form formulae for the coefficients of these powers which are reduced to expressions involving the classical Chebyshev polynomials of the second kind. For regular graphs, we also define a function that is the inner product of points on the H-curve with a suitably defined center of the space of occupational measures and show that, despite the nonlinearity of the inner-product, this function can be expressed as a linear function of auxiliary variables associated with our embedding. These results can be seen as stepping stones towards developing constraints on the space of occupational measures that may help characterize non-Hamiltonian graphs.

Suggested Citation

  • Jerzy A. Filar & Asghar Moeini, 2022. "Hamiltonian cycle curves in the space of discounted occupational measures," Annals of Operations Research, Springer, vol. 317(2), pages 605-622, October.
  • Handle: RePEc:spr:annopr:v:317:y:2022:i:2:d:10.1007_s10479-015-2030-2
    DOI: 10.1007/s10479-015-2030-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-2030-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-015-2030-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Vladimir Ejov & Jerzy A. Filar & Minh-Tuan Nguyen, 2004. "Hamiltonian Cycles and Singularly Perturbed Markov Chains," Mathematics of Operations Research, INFORMS, vol. 29(1), pages 114-131, February.
    2. Ali Eshragh & Jerzy Filar, 2011. "Hamiltonian Cycles, Random Walks, and Discounted Occupational Measures," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 258-270, May.
    3. Jerzy A. Filar & Dmitry Krass, 1994. "Hamiltonian Cycles and Markov Chains," Mathematics of Operations Research, INFORMS, vol. 19(1), pages 223-237, February.
    4. Vladimir Ejov & Jerzy A. Filar & Michael Haythorpe & Giang T. Nguyen, 2009. "Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 758-768, August.
    5. Richard M. Karp, 1977. "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 209-224, August.
    6. Nelly Litvak & Vladimir Ejov, 2009. "Markov Chains and Optimality of the Hamiltonian Cycle," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 71-82, February.
    7. Brunacci, Francesco A., 1988. "DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits," European Journal of Operational Research, Elsevier, vol. 34(2), pages 231-236, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ali Eshragh & Jerzy A. Filar & Thomas Kalinowski & Sogol Mohammadian, 2020. "Hamiltonian Cycles and Subsets of Discounted Occupational Measures," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 713-731, May.
    2. Ali Eshragh & Jerzy Filar, 2011. "Hamiltonian Cycles, Random Walks, and Discounted Occupational Measures," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 258-270, May.
    3. Vivek Borkar & Jerzy Filar, 2013. "Markov chains, Hamiltonian cycles and volumes of convex bodies," Journal of Global Optimization, Springer, vol. 55(3), pages 633-639, March.
    4. Nelly Litvak & Vladimir Ejov, 2009. "Markov Chains and Optimality of the Hamiltonian Cycle," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 71-82, February.
    5. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1979. "Complexity Of Vehicle Routing And Scheduling Problems," Econometric Institute Archives 272191, Erasmus University Rotterdam.
    6. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    7. Joost Berkhout & Bernd F. Heidergott, 2019. "Analysis of Markov Influence Graphs," Operations Research, INFORMS, vol. 67(3), pages 892-904, May.
    8. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
    9. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    10. Eugene A. Feinberg & Uriel G. Rothblum, 2012. "Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 129-153, February.
    11. Vladimir Ejov & Jerzy A. Filar & Michael Haythorpe & Giang T. Nguyen, 2009. "Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 758-768, August.
    12. Ali Eshragh & Jerzy Filar & Michael Haythorpe, 2011. "A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem," Annals of Operations Research, Springer, vol. 189(1), pages 103-125, September.
    13. Paul Sutcliffe & Andrew Solomon & Jenny Edwards, 2012. "Computing the variance of tour costs over the solution space of the TSP in polynomial time," Computational Optimization and Applications, Springer, vol. 53(3), pages 711-728, December.
    14. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    15. Ohlmann, Jeffrey W. & Bean, James C., 2009. "Resource-constrained management of heterogeneous assets with stochastic deterioration," European Journal of Operational Research, Elsevier, vol. 199(1), pages 198-208, November.
    16. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
    17. Eugene A. Feinberg, 2000. "Constrained Discounted Markov Decision Processes and Hamiltonian Cycles," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 130-140, February.
    18. Carlos Daganzo & Karen Smilowitz, 2006. "A note on asymptotic formulae for one-dimensional network flow problems," Annals of Operations Research, Springer, vol. 144(1), pages 153-160, April.
    19. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
    20. Rinnooy Kan, A. H. G., 1985. "Probabilistic Analysis Of Algorithms," Econometric Institute Archives 272328, Erasmus University Rotterdam.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:317:y:2022:i:2:d:10.1007_s10479-015-2030-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.