The online stochastic generalized assignment problem

DOI10.1007/978-3-642-40328-6_2MaRDI QIDQ2851845zbMATH OpenOpenAlexFDO

Authors Saeed Alaei, Vahid Liaghat, Mohammad T. 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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Marketing, advertising (90B60)

Recommendations

• Online stochastic matching: new algorithms with better bounds
• Online stochastic packing applied to display ad allocation
• The adwords problem with strict capacity constraints
• All-or-nothing generalized assignment with application to scheduling advertising campaigns

Cited in

(21)

• scientific article; zbMATH DE number 7053386 (Why is no real title available?)
• The adwords problem with strict capacity constraints
• Prophet secretary
• Prophet secretary
• The optimality of the online greedy algorithm in carpool and chairman assignment problems
• Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
• On the online track assignment problem
• All-or-nothing generalized assignment with application to scheduling advertising campaigns
• Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
• An on-line assignment problem with random effectiveness and costly information
• Adaptive Bin Packing with Overflow
• All-or-nothing generalized assignment with application to scheduling advertising campaigns
• Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems
• Improved online algorithms for knapsack and GAP in the random order model
• Online stochastic matching: new algorithms and bounds
• Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
• Online generalized assignment problem with historical information
• Randomized approximation and online algorithms for assignment problems
• Generalized assignment of time-sensitive item groups
• Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
• Competitive strategies for an online generalized assignment problem with a service consecution constraint

This page was built for publication: The online stochastic generalized assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851845)