Online assortment optimization with reusable resources
Year of publication: |
2022
|
---|---|
Authors: | Gong, Xiao-Yue ; Goyal, Vineet ; Iyengar, Garud N. ; Simchi-Levi, David ; Udwani, Rajan ; Wang, Shuangyu |
Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Hanover, Md. : INFORMS, ISSN 1526-5501, ZDB-ID 2023019-9. - Vol. 68.2022, 7, p. 4772-4785
|
Subject: | assortment optimization online algorithms | competitive ratio | coupling | reusable resources | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Technical note: static pricing : universal guarantees for reusable resources
Besbes, Omar, (2022)
-
Pseudo lower bounds for online parallel machine scheduling
Tan, Zhiyi, (2015)
-
On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
Zhang, An, (2015)
- More ...
-
Online Assortment Optimization with Reusable Resources
Gong, Xiao-Yue, (2021)
-
Bandits atop reinforcement learning : tackling online inventory models with cyclic demands
Gong, Xiao-Yue, (2024)
-
Bandits Atop Reinforcement Learning : Tackling Online Inventory Models With Cyclic Demands
Gong, Xiao-Yue, (2021)
- More ...