A stochastic algorithm for online bipartite resource allocation problems
暂无分享,去创建一个
[1] Richard M. Karp,et al. An introduction to randomized algorithms , 1991, Discret. Appl. Math..
[2] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[3] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.
[4] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[5] Russell Bent,et al. Online stochastic combinatorial optimization , 2006 .
[6] Patrick Jaillet,et al. Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..
[7] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[8] Patrick Jaillet,et al. Online Optimization—An Introduction , 2010 .
[9] Maryam Fazel,et al. Exponentiated Subgradient Algorithm for Online Optimization under the Random Permutation Model , 2014, ArXiv.
[10] Louis-Martin Rousseau,et al. Online stochastic optimization of radiotherapy patient scheduling , 2015, Health care management science.
[11] Antonio Alonso Ayuso,et al. Introduction to Stochastic Programming , 2009 .
[12] Vivek F. Farias,et al. Model Predictive Control for Dynamic Resource Allocation , 2012, Math. Oper. Res..
[13] Melvyn Sim,et al. Robust discrete optimization and network flows , 2003, Math. Program..
[14] Patrick Jaillet,et al. Near-Optimal Online Algorithms for Dynamic Resource Allocation Problems , 2012, ArXiv.
[15] Russell Bent,et al. Online Stochastic Optimization Without Distributions , 2005, ICAPS.
[16] Lance Fortnow,et al. Proceedings of the forty-third annual ACM symposium on Theory of computing , 2011, STOC 2011.
[17] Gagan Goel,et al. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.
[18] SaberiAmin,et al. AdWords and generalized online matching , 2007 .
[19] Zizhuo Wang,et al. A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..
[20] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[21] Nikhil R. Devanur,et al. Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.
[22] V. Farias,et al. Dynamic Allocation Problems with Volatile Demand , 2011 .
[23] K. Koch. Introduction to Bayesian Statistics , 2007 .
[24] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[25] Aranyak Mehta,et al. Online bipartite matching with unknown distributions , 2011, STOC '11.
[26] R. Ravi,et al. The Geometry of Online Packing Linear Programs , 2012, Math. Oper. Res..
[27] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[28] Jon Feldman,et al. Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.
[29] Berthold Vöcking,et al. Primal beats dual on online packing LPs in the random-order model , 2013, STOC.
[30] Bala Kalyanasundaram,et al. An optimal deterministic algorithm for online b-matching , 1996, Theor. Comput. Sci..
[31] John R. Birge,et al. Introduction to Stochastic programming (2nd edition), Springer verlag, New York , 2011 .
[32] Allan Borodin,et al. Online computation and competitive analysis , 1998 .