Finding the \(K\) best policies in a finite-horizon Markov decision process (Q2433472): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167322073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive control of constrained Markov chains: Criteria and policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Representation of Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Markov Decision Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Remarks on Finite Horizon Markovian Decision Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Undiscounted Stochastic Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gainfree Leontief substitution flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchic Markov processes and their applications in replacement models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-level hierarchic Markov processes as a framework for herd management support / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion shortest hyperpaths in random time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(K\) shortest hyperpaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A directed hypergraph model for random time dependent shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Algorithm for a Generalization of the Shortest-Path Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 21:23, 24 June 2024

scientific article
Language Label Description Also known as
English
Finding the \(K\) best policies in a finite-horizon Markov decision process
scientific article

    Statements

    Finding the \(K\) best policies in a finite-horizon Markov decision process (English)
    0 references
    27 October 2006
    0 references
    finite-horizon Markov decision processes
    0 references
    stochastic dynamic programming
    0 references
    directed hypergraphs
    0 references
    hyperpaths
    0 references
    \(K\) best policies
    0 references

    Identifiers