Sciweavers

867 search results - page 59 / 174
» The Generalized Maximum Coverage Problem
Sort
View
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
14 years 1 months ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
FOCS
2006
IEEE
14 years 2 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
ACMSE
2008
ACM
13 years 10 months ago
Optimization of the multiple retailer supply chain management problem
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...
Caio Soares, Gerry V. Dozier, Emmett Lodree, Jared...
AAAI
2000
13 years 9 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith