IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v62y2014i4p876-890.html
   My bibliography  Save this item

A Dynamic Near-Optimal Algorithm for Online Linear Programming

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Juan S. Borrero & Oleg A. Prokopyev & Denis Sauré, 2019. "Sequential Interdiction with Incomplete Information and Learning," Operations Research, INFORMS, vol. 67(1), pages 72-89, January.
  2. Levi DeValve & Saša Pekeč & Yehua Wei, 2020. "A Primal-Dual Approach to Analyzing ATO Systems," Management Science, INFORMS, vol. 66(11), pages 5389-5407, November.
  3. Hesam Ahmadi & Uday V. Shanbhag, 2020. "On the resolution of misspecified convex optimization and monotone variational inequality problems," Computational Optimization and Applications, Springer, vol. 77(1), pages 125-161, September.
  4. Clifford Stein & Van-Anh Truong & Xinshang Wang, 2020. "Advance Service Reservations with Heterogeneous Customers," Management Science, INFORMS, vol. 66(7), pages 2929-2950, July.
  5. Xin Huang & Duan Li & Daniel Zhuoyu Long, 2020. "Scenario-decomposition Solution Framework for Nonseparable Stochastic Control Problems," Papers 2010.08985, arXiv.org.
  6. Wei Fan & Nian Liu & Jianhua Zhang, 2016. "An Event-Triggered Online Energy Management Algorithm of Smart Home: Lyapunov Optimization Approach," Energies, MDPI, vol. 9(5), pages 1-24, May.
  7. Shipra Agrawal & Nikhil R. Devanur, 2019. "Bandits with Global Convex Constraints and Objective," Operations Research, INFORMS, vol. 67(5), pages 1486-1502, September.
  8. Ge Yu & Sheldon H. Jacobson, 2020. "Primal-dual analysis for online interval scheduling problems," Journal of Global Optimization, Springer, vol. 77(3), pages 575-602, July.
  9. Devansh Jalota & Yinyu Ye, 2022. "Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements," Papers 2205.00825, arXiv.org, revised Sep 2024.
  10. Yuming Deng & Xinhui Zhang & Tong Wang & Lin Wang & Yidong Zhang & Xiaoqing Wang & Su Zhao & Yunwei Qi & Guangyao Yang & Xuezheng Peng, 2023. "Alibaba Realizes Millions in Cost Savings Through Integrated Demand Forecasting, Inventory Management, Price Optimization, and Product Recommendations," Interfaces, INFORMS, vol. 53(1), pages 32-46, January.
  11. Ding, Xiaoshu & Qi, Qi & Jian, Sisi & Yang, Hai, 2023. "Mechanism design for Mobility-as-a-Service platform considering travelers’ strategic behavior and multidimensional requirements," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 1-30.
  12. Arash Asadpour & Xuan Wang & Jiawei Zhang, 2020. "Online Resource Allocation with Limited Flexibility," Management Science, INFORMS, vol. 66(2), pages 642-666, February.
  13. Anupam Gupta & Marco Molinaro, 2016. "How the Experts Algorithm Can Help Solve LPs Online," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1404-1431, November.
  14. Markus Ettl & Pavithra Harsha & Anna Papush & Georgia Perakis, 2020. "A Data-Driven Approach to Personalized Bundle Pricing and Recommendation," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 461-480, May.
  15. Zikun Ye & Dennis J. Zhang & Heng Zhang & Renyu Zhang & Xin Chen & Zhiwei Xu, 2023. "Cold Start to Improve Market Thickness on Online Advertising Platforms: Data-Driven Algorithms and Field Experiments," Management Science, INFORMS, vol. 69(7), pages 3838-3860, July.
  16. Lichun Li & Cedric Langbort, 2019. "Iterative Computation of Security Strategies of Matrix Games with Growing Action Set," Dynamic Games and Applications, Springer, vol. 9(4), pages 942-964, December.
  17. Devansh Jalota & Dario Paccagnan & Maximilian Schiffer & Marco Pavone, 2023. "Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 560-577, May.
  18. Zhaohua Chen & Chang Wang & Qian Wang & Yuqi Pan & Zhuming Shi & Zheng Cai & Yukun Ren & Zhihua Zhu & Xiaotie Deng, 2022. "Dynamic Budget Throttling in Repeated Second-Price Auctions," Papers 2207.04690, arXiv.org, revised Dec 2023.
  19. Negin Gorlezaei & Patrick Jaillet & Zijie Zhou, 2022. "Online Resource Allocation with Samples," Papers 2210.04774, arXiv.org.
  20. Santiago R. Balseiro & Jon Feldman & Vahab Mirrokni & S. Muthukrishnan, 2014. "Yield Optimization of Display Advertising with Ad Exchange," Management Science, INFORMS, vol. 60(12), pages 2886-2907, December.
  21. Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
  22. König, Eva & Schön, Cornelia, 2021. "Railway delay management with passenger rerouting considering train capacity constraints," European Journal of Operational Research, Elsevier, vol. 288(2), pages 450-465.
  23. Ali Hojjat & John Turner & Suleyman Cetintas & Jian Yang, 2017. "A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements," Operations Research, INFORMS, vol. 65(2), pages 289-313, April.
  24. Eva König, 2020. "A review on railway delay management," Public Transport, Springer, vol. 12(2), pages 335-361, June.
  25. Dawsen Hwang & Patrick Jaillet & Vahideh Manshadi, 2021. "Online Resource Allocation Under Partially Predictable Demand," Operations Research, INFORMS, vol. 69(3), pages 895-915, May.
  26. Th`anh Nguyen & Alexander Teytelboym & Shai Vardi, 2023. "Dynamic Combinatorial Assignment," Papers 2303.13967, arXiv.org.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.