Markov chains, Hamiltonian cycles and volumes of convex bodies

DOI10.1007/s10898-011-9819-6zbMath1268.90113WikidataQ56565420 ScholiaQ56565420MaRDI QIDQ1945510

Vivek S. Borkar, Jerzy A. Filar

Publication date: 8 April 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9819-6

zbMATH Keywords

Markov decision process; discounted cost; Hamiltonian cycle problem; uniform sampling; volumes of convex sets

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C40: Markov and semi-Markov decision processes

Related Items

Feasible Bases for a Polytope Related to the Hamilton Cycle Problem, Hamiltonian Cycles and Subsets of Discounted Occupational Measures, On the fastest finite Markov processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
• Sample complexity for Markov chain self-tuner
• An interior point heuristic for the Hamiltonian cycle problem via Markov decision processes
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Constrained Discounted Markov Decision Processes and Hamiltonian Cycles
• Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
• Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation
• On the Complexity of Computing the Volume of a Polyhedron
• Hamiltonian Cycles and Markov Chains
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Controlled Markov Chains, Graphs, and Hamiltonicity