Case—AdWords to AdWards: Online Optimization for Hospital Patient Placement

Published Online:https://doi.org/10.1287/ited.2025.0147cs

Online capacity-balancing algorithms have been studied extensively in computer science, operations research, and operations management. Good references to learn more about the subject include:

Further Reading

  • Acimovic J, Farias VF (2019) The Fulfillment-Optimization Problem, INFORMS TutORials in Operations Research (INFORMS, Catonsville, MD), 218–237.Link, Google Scholar
  • Acimovic J, Graves SC (2015) Making better fulfillment decisions on the fly in an online retail environment. Manufacturing Service Oper. Management 17(1):34–51.Link, Google Scholar
  • Dwyer‐Matzky K, Pachamanova D, Tilson V (2021) Accounting for capacity: A real‐time optimization approach to managing observation unit utilization. Naval Res. Logist. 68(5):534–555.Crossref, Google Scholar
  • Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
  • Kalyanasundaram B, Pruhs KR (2000) An optimal deterministic algorithm for online B-matching. Theor. Comput. Sci. 233(1–2):319–325.Crossref, Google Scholar
  • Mehta A (2013) Online matching and ad allocation. Foundations Trends Theoret. Comput. Sci. 8(4):265–368.Crossref, Google Scholar
  • Mehta A, Saberi A, Vazirani U, Vazirani V (2007) Adwords and generalized online matching. J. ACM 54(5):22-es.Crossref, Google 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.