A stochastic programming approach to scheduling in TAC SCM
暂无分享,去创建一个
Michael Carl Tschantz | Michael Benisch | Victor Naroditskiy | Amy Greenwald | A. Greenwald | V. Naroditskiy | Michael Benisch
[1] Amy Greenwald. Bidding Marginal Utility in Simultaneous Auctions , 2003, IJCAI.
[2] Robert Givan,et al. On-line Scheduling via Sampling , 2000, AIPS.
[3] Matthew Brand,et al. Marginalizing Out Future Passengers in Group Elevator Control , 2003, UAI.
[4] Robert Tibshirani,et al. An Introduction to the Bootstrap , 1994 .
[5] Paul Zarowin,et al. The boundaries of financial reporting and how to extend them , 1999 .
[6] John M. Wilson,et al. Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..
[7] A. Shapiro,et al. The Sample Average Approximation Method for Stochastic Programs with Integer Recourse , 2002 .
[8] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[9] Russell Bent,et al. Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..
[10] David A. McAllester,et al. Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions , 2003, J. Artif. Intell. Res..
[11] Alexander Shapiro,et al. The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..
[12] A. Shapiro,et al. On rate of convergence of Monte Carlo approximations of stochastic programs , 1998 .
[13] Alexander Shapiro,et al. On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs , 2000, SIAM J. Optim..