## Search

Now showing items 1-8 of 8

#### Connected co-spectral graphs are not necessarily both Hamiltonian

(Australian Mathematical Society, 2005)

There are many examples of co-spectral graphs
where one is connected while the other is not. A Hamiltonian cycle is a closed
path that visits every vertex exactly once. Naturally, a graph needs to be connected to
be ...

#### A non-standard branch and bound method for the Hamiltonian cycle problem

(Australian Mathematical Society, 2000)

In this note, we consider an embedding of a Hamiltonian cycle problem in a Markov decision process (MDP). We propose a branch and bound type method based on the frequency polytope resulting from this embedding. Among the ...

#### Analytic perturbations and systematic bias in staistical modeling and inference

(Institute of Mathematical Statistics, 2008)

In this paper we provide a comprehensive study of statistical inference in linear and allied models which exhibit some analytic perturbations in their design and covariance matrices. We also indicate a few potential ...

#### Decomposition and parallel processing techniques for two-time scale controlled Markov chains

(Institute of Electrical and Electronic Engineers, 2000)

This paper deals with a class of ergodic control problems
for systems described by Markov chains with
strong and weak interactions. These systems are composed
of a set of m subchains that are weakly coupled.
Using results ...

#### Control of singularly perturbed hybrid stochastic systems

(Institute of Electrical and Electronic Engineers, 2001)

In this paper, we study a class of optimal stochastic
control problems involving two different time scales. The fast
mode of the system is represented by deterministic state equations
whereas the slow mode of the system ...

#### Stochastic target hitting time and the problem of early retirement

(Institute of Electrical and Electronic Engineers, 2004)

We consider a problem of optimal control of a “retirement
investment fund” over a finite time horizon with a target
hitting time criteria. That is, we wish to decide, at each stage, what
percentage of the current retirement ...

#### Hamiltonian cycles and singularly perturbed Markov chains

(INFORMS, 2004)

We consider the Hamiltonian cycle problem embedded in a singularly perturbed Markov decision process. We also consider a functional on the space of deterministic policies of the process that consist of the (1,1)-entry of ...

#### Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem

(INFORMS, 2009)

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 ...