Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Hamiltonian Cycles and Markov Chains

Jerzy A. Filar and Dmitry Krass
Mathematics of Operations Research
Vol. 19, No. 1 (Feb., 1994), pp. 223-237
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3690387
Page Count: 15
  • Download ($30.00)
  • Cite this Item
Hamiltonian Cycles and Markov Chains
Preview not available

Abstract

In this paper we derive new characterizations of the Hamiltonian cycles of a directed graph, and a new LP-relaxation of the Traveling Salesman Problem. Our results are obtained via an embedding of these combinatorial optimization problems in suitably perturbed controlled Markov chains. This embedding lends probabilistic interpretation to many of the quantities of interest, which in turn lead naturally to the introduction of a quadratic entropy-like function.

Page Thumbnails

  • Thumbnail: Page 
223
    223
  • Thumbnail: Page 
224
    224
  • Thumbnail: Page 
225
    225
  • Thumbnail: Page 
226
    226
  • Thumbnail: Page 
227
    227
  • Thumbnail: Page 
228
    228
  • Thumbnail: Page 
229
    229
  • Thumbnail: Page 
230
    230
  • Thumbnail: Page 
231
    231
  • Thumbnail: Page 
232
    232
  • Thumbnail: Page 
233
    233
  • Thumbnail: Page 
234
    234
  • Thumbnail: Page 
235
    235
  • Thumbnail: Page 
236
    236
  • Thumbnail: Page 
237
    237