Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem|
|Citation:||Mathematics of Operations Research, 2009; 34(3):758-768|
|Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen|
|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 1-randomised policies, we characterise the latter. This characterisation indicates that the total number of such policies is significantly smaller than the subset of all 1-randomised policies. Finally, we present some numerical results.|
|Keywords:||Markov decision processes; Hamiltonian cycles; branch-and-bound algorithm|
|Rights:||Copyright status unknown|
|Appears in Collections:||Applied Mathematics publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.