Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Hamiltonian cycle problem and Markov chains.

From MaRDI portal
Publication:663172
Jump to:navigation, search

DOI10.1007/978-1-4614-3232-6zbMath1246.90001OpenAlexW206027754MaRDI QIDQ663172

Giang T. Nguyen, Vivek S. Borkar, Jerzy A. Filar, Vladimir V. Ežov

Publication date: 14 February 2012

Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-3232-6


zbMATH Keywords

Markov chainsMarkov decision processesgraph theorycombinatorial programmingHamiltonian cycle problem


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Graph theory (05C99)


Related Items (5)

Analysis of Markov Influence Graphs ⋮ Enumeration of unlabeled uniform hypergraphs ⋮ Constructing families of cospectral regular graphs ⋮ On the fastest finite Markov processes ⋮ The Buck-Passing Game




This page was built for publication: Hamiltonian cycle problem and Markov chains.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:663172&oldid=12567561"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 09:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki