The Online Stochastic Generalized Assignment Problem
From MaRDI portal
Publication:2851845
DOI10.1007/978-3-642-40328-6_2zbMath1405.68450OpenAlexW56687990MaRDI QIDQ2851845
Saeed Alaei, Vahid Liaghat, Mohammad Taghi Hajiaghayi
Publication date: 4 October 2013
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40328-6_2
Combinatorial optimization (90C27) Marketing, advertising (90B60) Online algorithms; streaming algorithms (68W27)
Related Items (9)
Prophet Secretary ⋮ Prophet Secretary ⋮ Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Online stochastic matching: new algorithms and bounds ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts ⋮ Online generalized assignment problem with historical information ⋮ Adaptive Bin Packing with Overflow
This page was built for publication: The Online Stochastic Generalized Assignment Problem
