Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations
暂无分享,去创建一个
[1] Edmund H. Durfee,et al. Stationary Deterministic Policies for Constrained MDPs with Multiple Rewards, Costs, and Discount Factors , 2005, IJCAI.
[2] R. Kapuściński,et al. Value of Information in Capacitated Supply Chains , 1999 .
[3] Powell E. Robinson,et al. Flow Coordination and Information Sharing in Supply Chains: Review, Implications, and Directions for Future Research , 2002, Decis. Sci..
[4] Varun Grover,et al. Strategic Manufacturing Planning Systems and Their Linkage to Planning System Success , 2002, Decis. Sci..
[5] Yao Zhao,et al. The value of information sharing in a two‐stage supply chain with production capacity constraints , 2001, Probability in the Engineering and Informational Sciences.
[6] Marshall L. Fisher,et al. Supply Chain Inventory Management and the Value of Shared Information , 2000 .
[7] Yasemin Serin,et al. Markov decision processes under observability constraints , 2005, Math. Methods Oper. Res..
[8] G. Dantzig,et al. Linear Programming in a Markov Chain , 1962 .
[9] D. Simchi-Levi,et al. The value of information sharing in a two-stage supply chain with production capacity constraints , 2003 .
[10] Srinagesh Gavirneni,et al. Information Flows in Capacitated Supply Chains with Fixed Ordering Costs , 2002, Manag. Sci..