A nonasymptotic analysis for re-solving heuristic in online matching
Year of publication: |
2022
|
---|---|
Authors: | Wang, Hao ; Yan, Zhenzhen ; Bei, Xiaohui |
Published in: |
Production and operations management : the flagship research journal of the Production and Operations Management Society. - London : Sage Publications, ISSN 1937-5956, ZDB-ID 2151364-8. - Vol. 31.2022, 8, p. 3096-3124
|
Subject: | competitive ratio | online bipartite matching | randomized algorithm | re-solving heuristic | Heuristik | Heuristics | Algorithmus | Algorithm | Matching | Theorie | Theory | Online-Handel | Online retailing |
-
Models and algorithms for packing rectangles into the smallest square
Martello, Silvano, (2015)
-
Online algorithms with advice for the dual bin packing problem
Renault, Marc P., (2017)
-
Combinatorial abilities and heuristic behavior in online search environments
Di Caprio, Debora, (2021)
- More ...
-
A Non-Asymptotic Analysis for Re-Solving Heuristic in Online Matching
Wang, Hao, (2022)
-
Bei, Xiaohui, (2025)
-
Truthful fair division without free disposal
Bei, Xiaohui, (2020)
- More ...