Andere Kunden interessierten sich auch für
![A Text Book of Hamiltonian Graphs and Its Applications]( "A Text Book of Hamiltonian Graphs and Its Applications")
A Text Book of Hamiltonian Graphs and Its Applications26,99 €![Paths and Cycles in Digraphs]( "Paths and Cycles in Digraphs")
Paths and Cycles in Digraphs32,99 €![Heteroclinic cycles in thermal convection models]( "Heteroclinic cycles in thermal convection models")
Heteroclinic cycles in thermal convection models38,99 €![Advances in Hamiltonian, Elliptic Problems and Critical Point Theory]( "Advances in Hamiltonian, Elliptic Problems and Critical Point Theory")
Advances in Hamiltonian, Elliptic Problems and Critical Point Theory36,99 €![Total labeling of some families of trees and cycles with chords]( "Total labeling of some families of trees and cycles with chords")
Total labeling of some families of trees and cycles with chords32,99 €![Lagrangian and Hamiltonian geometries. Applications to Mechanics]( "Lagrangian and Hamiltonian geometries. Applications to Mechanics")
Lagrangian and Hamiltonian geometries. Applications to Mechanics53,99 €![Introduction to Hamiltonian fuzzy Graphs and Containers in fuzzy graph]( "Introduction to Hamiltonian fuzzy Graphs and Containers in fuzzy graph")
Introduction to Hamiltonian fuzzy Graphs and Containers in fuzzy graph40,99 €
In 2000, a new polytope defined by the Discounted Occupational Measures (DOM) was developed for the Hamiltonian Cycle Problem (HCP). In this monograph, we exploit geometric properties of extreme points of that polytope. In particular, we refine the feasible region induced by that polytope into a narrower one. We show that the problem of finding a Hamiltonian cycle in a given graph is equivalent to the problem of finding a common extreme point of two especially constructed polytopes. Correspondingly, we develop new optimization models, as well as, random walk algorithms, to solve HCP. In addition, we develop a new hybrid algorithm for the HCP by synthesising DOM and the Cross Entropy method. Finally, we present algebraic properties of the class of stochastic matrices induced by a Hamiltonian cycle. These theoretical results are used to develop a new polytope containing all possible Hamiltonian solutions corresponding to a given graph.