Dynamic relaxations for online bipartite matching
Year of publication: |
2022
|
---|---|
Authors: | Torrico, Alfredo ; Toriello, Alejandro |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 4, p. 1871-1884
|
Subject: | dynamic programming | facet-defining inequality | online matching | time-indexed relaxations | Matching | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming | Online-Handel | Online retailing | Electronic Commerce | E-commerce | Theorie | Theory |
-
The Bayesian prophet : a low-regret framework for online decision making
Vera, Alberto, (2021)
-
Online allocation and pricing : constant regret via Bellman inequalities
Vera, Alberto, (2021)
-
Online dynamic submodular optimization
Lesage-Landry, Antoine, (2023)
- More ...
-
Additive consisency of risk measures and its application to risk-averse routing in networks
Cominetti, Roberto, (2016)
-
Structured robust submodular maximization : offline and online algorithms
Torrico, Alfredo, (2021)
-
Hu, Weihong, (2020)
- More ...