Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations (Q3621914): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/nav.20329 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005483729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply Chain Inventory Management and the Value of Shared Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Value of Information in Capacitated Supply Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Flows in Capacitated Supply Chains with Fixed Ordering Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov decision processes under observability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in a Markov Chain / rank
 
Normal rank

Latest revision as of 11:40, 1 July 2024

scientific article
Language Label Description Also known as
English
Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations
scientific article

    Statements

    Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 April 2009
    0 references
    Markov decision process
    0 references
    heuristics
    0 references
    optimal control
    0 references

    Identifiers