Flinders University Flinders Academic Commons

Flinders Academic Commons >
Flinders Digital Archive >
Science and Engineering >
Computer Science, Engineering and Mathematics  >
Computer Science, Engineering and Mathematics - Collected Works >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2328/26401

Title: Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem
Authors: Ejov, Vladimir
Filar, Jerzy A
Haythorpe, Michael
Nguyen, Giang T
Keywords: Mathematics
Hamiltonian cycle problem
Markov decision process
Issue Date: 2009
Publisher: INFORMS
Citation: Ejov, V., Filar, J.A., Haythorpe, M. and Nguyen, G.T., 2009. Refined MDP-based branch-and-fix algorithm for the Hamiltonian Cycle Problem. Mathematics of Operations Research, 34(3), 758-768.
Abstract: We consider the famous Hamiltonian cycle problem (HCP) embedded in a Markov decision process (MDP). More specifically, we consider the HCP as an optimisation problem over the space of occupation measures induced by the MDP's stationary policies. In recent years, this approach to the HCP has led to a number of alternative formulations and algorithmic approaches. In this paper, we focus on a specific embedding because of the work of Feinberg. We present a "branch-and-fix" type algorithm that solves the HCP. At each branch of the algorithm, only a linear program needs to be solved and the dimensions of the successive linear programs are shrinking rather than expanding. Because the nodes of the branch-and-fix tree correspond to specially structured l-randomised policies, we characterise the latter. This characterisation indicates that the total number of such policies is significantly smaller than the subset of all l-randomised policies. Finally, we present some numerical results.
URI: http://hdl.handle.net/2328/26401
ISSN: 0364-765X
Appears in Collections:Computer Science, Engineering and Mathematics - Collected Works

Files in This Item:

File Description SizeFormat
Ejov Refined.pdf2.21 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback