Online linear programming : dual convergence, new algorithms, and regret bounds
Year of publication: |
2022
|
---|---|
Authors: | Li, Xiaocheng ; Ye, Yinyu |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 70.2022, 5, p. 2948-2966
|
Subject: | online linear programming | Optimization | sequential decision making | stochastic dynamic programming | stochastic programming | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming | Stochastischer Prozess | Stochastic process | Algorithmus | Algorithm | Entscheidungstheorie | Decision theory |
-
Optimization of Stochastic Discrete Systems and Control on Complex Networks : Computational Networks
Lozovanu, Dmitrii, (2015)
-
Optimization of stochastic discrete systems and control on complex networks : computational networks
Lozovanu, Dmitrii, (2015)
-
Penalty-based algorithms for the stochastic obstacle scene problem
Aksakalli, Vural, (2014)
- More ...
-
Technical note: an improved analysis of LP-based control for revenue management
Chen, Guanting, (2024)
-
Demand Prediction, Predictive Shipping, and Product Allocation for Large-Scale E-Commerce
Li, Xiaocheng, (2019)
-
Li, Chenxu, (2015)
- More ...