Pages that link to "Item:Q2757627"
From MaRDI portal
The following pages link to Constrained discounted Markov decision processes and Hamiltonian cycles. (Q2757627):
Displaying 23 items.
- Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints (Q296787) (← links)
- On transition matrices of Markov chains corresponding to Hamiltonian cycles (Q338897) (← links)
- An exact iterative search algorithm for constrained Markov decision processes (Q458792) (← links)
- Discounted continuous-time constrained Markov decision processes in Polish spaces (Q655591) (← links)
- A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem (Q666352) (← links)
- Random search for constrained Markov decision processes with multi-policy improvement (Q895275) (← links)
- Sleeping experts and bandits approach to constrained Markov decision processes (Q901196) (← links)
- Compactness of the space of non-randomized policies in countable-state sequential decision processes (Q966432) (← links)
- Neighbourhood search for constructing Pareto sets (Q1006544) (← links)
- Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
- Markov chains, Hamiltonian cycles and volumes of convex bodies (Q1945510) (← links)
- Light robustness in the optimization of Markov decision processes with uncertain parameters (Q2003420) (← links)
- Hamiltonian cycle curves in the space of discounted occupational measures (Q2095221) (← links)
- Convergence of Markov decision processes with constraints and state-action dependent discount factors (Q2301208) (← links)
- On the fastest finite Markov processes (Q2326015) (← links)
- Constrained continuous-time Markov decision processes with average criteria (Q2483010) (← links)
- On the Hamiltonicity Gap and doubly stochastic matrices (Q3055760) (← links)
- Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem (Q3169065) (← links)
- Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes (Q4467171) (← links)
- Feasible Bases for a Polytope Related to the Hamilton Cycle Problem (Q5026442) (← links)
- Hamiltonian Cycles and Subsets of Discounted Occupational Measures (Q5119853) (← links)
- Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions (Q6080639) (← links)
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies (Q6098853) (← links)
