Conic optimization is a significant and thriving research area within the optimization
community. Conic optimization is the general class of problems concerned with optimizing a …

Alan Sugar is a business legend. When it comes to business, Sugar is both feared and
fearless. Shrewd businessman, inspirational figure and sweet-talking star of The Apprentice …

In this paper, we propose a new hybrid algorithm for the Hamiltonian cycle problem by
synthesizing the Cross Entropy method and Markov decision processes. In particular, this …

This research monograph summarizes a line of research that maps certain classical
problems of discrete mathematics and operations research-such as the Hamiltonian Cycle …

The longest cycle problem is the problem of finding a cycle with maximal vertices in a graph.
Although it is solvable in polynomial time on few trivial graph classes, the longest cycle …

Markov Chain Based Algorithms for the Hamiltonian Cycle Problem Page 1 Markov Chain
Based Algorithms for the Hamiltonian Cycle Problem A dissertation submitted for the degree …

This manuscript summarizes a line of research that maps certain classical problems of
discrete mathematics—such as the Hamiltonian Cycle and the Traveling Salesman …

We study a certain polytope arising from embedding the Hamiltonian cycle problem in a
discounted Markov decision process. The Hamiltonian cycle problem can be reduced to …

We consider two classes of games in which players are the vertices of a directed graph.
Initially, nature chooses one player according to some fixed distribution and gives the player …

A Newton-type active set algorithm for large-scale minimization subject to polyhedral
constraints is proposed. The algorithm consists of a gradient projection step, a second-order …