Optimal regularized online allocation by adaptive re-solving
| Year of publication: |
2025
|
|---|---|
| Authors: | Ma, Wanteng ; Cao, Ying ; Tsang, Danny H. K. ; Xia, Dong |
| Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 73.2025, 4, p. 2079-2096
|
| Subject: | online allocation problems | Optimization | re-solving strategy | regret | Allokation | Allocation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Electronic Commerce | E-commerce | Online-Handel | Online retailing |
-
The best of many worlds : dual mirror descent for online allocation problems
Balseiro, Santiago R., (2023)
-
Online allocation and pricing : constant regret via Bellman inequalities
Vera, Alberto, (2021)
-
Order batch picking optimization under different storage scenarios for e-commerce warehouses
Yang, Peng, (2020)
- More ...
-
Does ambidextrous leadership motivate work crafting?
Ma, Jianfeng, (2019)
-
Zhou, Xing, (2018)
-
Revolution trend investigation of tourism destination image with machine learning
Dong, Xia, (2025)
- More ...