Model Predictive Control for Dynamic Resource Allocation

Published Online:https://doi.org/10.1287/moor.1120.0548

References

  • Adelman D. Dynamic bid price in revenue management. Oper. Res. (2007) 55(4):647–661LinkGoogle Scholar
  • Agrawal S, Wang Z, Ye Y. A dynamic near-optimal algorithm for online linear programming. CoRR (2009) . abs/0911.2974Google Scholar
  • Akan M, Ata B. Bid-price controls for network revenue management: Martingale characterization of optimal bid prices. Math. Oper. Res. (2009) 34(4):912–936LinkGoogle Scholar
  • Ball MO, Queyranne M. Toward robust revenue management: Competitive analysis of online booking. Oper. Res. (2009) 57(4):950–963LinkGoogle Scholar
  • Bemporad A. Model-based predictive control design: New trends and tools. CDC06: 45th Conf. Decision and Control (2006) San Diego(IEEE, New York) 6678–6683Google Scholar
  • Bertsekas DP, Shreve SE. Stochastic Optimal Control: The Discrete-Time Case (2007) (Athena Scientific, Nashua, NH) Google Scholar
  • Bertsimas D, Demir R. An approximate dynamic programming approach to multidimensional knapsack problems. Management Sci. (2002) 48:550–565LinkGoogle Scholar
  • Besbes O, Maglaras C. Revenue optimization for a make-to-order queue in an uncertain market environment. Oper. Res. (2009) 57(6):1438–1450LinkGoogle Scholar
  • Bramson M. State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems (1998) 30:89–148CrossrefGoogle Scholar
  • Buchbinder N, Naor J. Online primal-dual algorithms for covering and packing. Math. Oper. Res. (2009) 34:270–286LinkGoogle Scholar
  • Chen H, Yao DD. Dynamic scheduling of a multiclass fluid network. Oper. Res. (1993) 41:1104–1115LinkGoogle Scholar
  • Chen Y, Farias VF. Simple Policies for Dynamic Pricing with Imperfect Forecasts (2010) . PreprintGoogle Scholar
  • Farias VF, Van Roy B. An Approximate Dynamic Programming Approach to Network Revenue Management (2007) . PreprintGoogle Scholar
  • Farias VF, Van Roy B. Dynamic pricing with a prior on market response. Oper. Res. (2010) 58(1):16–29LinkGoogle Scholar
  • Gallego G, van Ryzin G. A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. (1997) 45(1):24–41LinkGoogle Scholar
  • Jasin S, Kumar S. A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. (2012) 37(2):313–345LinkGoogle Scholar
  • Karatzas I, Shreve SE. Brownian Motion and Stochastic Calculus (1991) (Springer, New York) Google Scholar
  • Kleinberg R. A multiple-choice secretary algorithm with applications to online auctions. Proc. Sixteenth Annual ACM-SIAM Sympos. Discrete Algorithms. SODA '05 (2005) (Society for Industrial and Applied Mathematics, Philadelphia) 630–631Google Scholar
  • Maglaras C, Meissner J. Dynamic pricing strategies for multiproduct revenue management problems. Manufacturing Service Oper. Management (2006) 8(2):136–148LinkGoogle Scholar
  • Mahdian M, Nazerzadeh H, Saberi A. Online optimization with uncertain information. ACM Trans. Algorithms (2012) 8(1):2CrossrefGoogle Scholar
  • Mehta A, Saberi A, Vazirani U, Vazirani V. Adwords and generalized on-line matching. FOCS'05: Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (2005) (IEEE Computer Society Press, Los Alamitos, CA) 264–273CrossrefGoogle Scholar
  • Reiman MI, Wang Q. An asymptotically optimal policy for a quantity-based network revenue management problem. Math. Oper. Res. (2008) 33(2):257–282LinkGoogle Scholar
  • Shah D, Wischik D. Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. (2011) . ForthcomingGoogle Scholar
  • Zhang D, Adelman D. An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. (2009) 43(3):381–394LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.