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.
"synopsis" may belong to another edition of this title.
Dr Ali Eshragh received his B.Sc. and M.Sc. in industrial engineering from Sharif University of Technology, Tehran. In 2008, he was awarded the IPRS scholarship to pursue his PhD at the University of South Australia, Adelaide. He received his PhD in August, 2011. He is currently a postdoctoral research fellow at the University of Adelaide.
"About this title" may belong to another edition of this title.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 168 pp. Englisch. Seller Inventory # 9783846548875
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Eshragh AliDr Ali Eshragh received his B.Sc. and M.Sc. in industrial engineering from Sharif University of Technology, Tehran. In 2008, he was awarded the IPRS scholarship to pursue his PhD at the University of South Australia, Adela. Seller Inventory # 5498321
Quantity: Over 20 available
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Hamiltonian Cycles and the Space of Discounted Occupational Measures | Investigating Hamiltonian Cycles through Extreme Points of Certain Polytopes by Random Walks | Ali Eshragh | Taschenbuch | 168 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846548875 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. Seller Inventory # 106711333
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 168 pp. Englisch. Seller Inventory # 9783846548875
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 168 pages. 8.66x5.91x0.38 inches. In Stock. Seller Inventory # 3846548871
Quantity: 1 available