Narrow search
Showing 1 - 7 of 7
Cover Image
The recommender problem with convex hulls
Bougnol, Marie-Laure; Dulá, José H. - In: INFOR : information systems and operational research 62 (2024) 2, pp. 259-272
Persistent link: https://www.econbiz.de/10014545403
Cover Image
Unified algorithms for online learning and competitive analysis
Buchbinder, Niv; Chen, Shahar; Naor, Joseph; Shamir, Ohad - In: Mathematics of operations research 41 (2016) 2, pp. 612-625
Persistent link: https://www.econbiz.de/10011520498
Cover Image
Strong algorithms for the ordinal matroid secretary problem
Soto, José A.; Turkieltaub, Abner; Verdugo, Victor - In: Mathematics of operations research 46 (2021) 2, pp. 642-673
Persistent link: https://www.econbiz.de/10012582192
Cover Image
Interdicting structured combinatorial optimization problems with {0, 1}-objectives
Chestnut, Stephen R.; Zenklusen, Rico - In: Mathematics of operations research 42 (2017) 1, pp. 144-166
Persistent link: https://www.econbiz.de/10011654613
Cover Image
A simple O(log log(rank))-competitive algorithm for the matroid secretary problem
Feldman, Moran; Svensson, Ola Nils Anders; Zenklusen, Rico - In: Mathematics of operations research 43 (2018) 2, pp. 638-650
Persistent link: https://www.econbiz.de/10011868640
Cover Image
Recognizing series-parallel matrices in linear time
Walter, Matthias - In: INFORMS journal on computing : JOC ; charting new … 35 (2023) 6, pp. 1404-1418
Persistent link: https://www.econbiz.de/10014471525
Cover Image
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model
Balkanski, Eric; Rubinstein, Aviad; Singer, Yaron - In: Operations research 70 (2022) 5, pp. 2967-2981
Persistent link: https://www.econbiz.de/10014307144