How the experts algorithm can help solve LPs online
Year of publication: |
November 2016
|
---|---|
Authors: | Gupta, Anupam ; Molinaro, Marco |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 4, p. 1404-1431
|
Subject: | linear programming | online algorithms | experts algorithm | secretary problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Experten | Experts | Online-Handel | Online retailing |
-
The geometry of online packing linear programs
Molinaro, Marco, (2014)
-
A dynamic near-optimal algorithm for online linear programming
Agrawal, Shipra, (2014)
-
A dynamic learning algorithm for online matching problems with concave returns
Chen, Xiao Alison, (2015)
- More ...
-
Characterization of the split closure via geometric lifting
Basu, Amitabh, (2015)
-
Some lower bounds on sparse outer approximations of polytopes
Dey, Santanu S., (2015)
-
Lifting Gomory cuts with bounded variables
Cornuéjols, Gérard, (2013)
- More ...