A randomized algorithm for the min-max selecting items problem with uncertain weights

This paper deals with the min-max version of the problem of selecting p items of the minimum total weight out of a set of n items, where the item weights are uncertain. The discrete scenario representation of uncertainty is considered. The computational complexity of the problem is explored. A randomized algorithm for the problem is then proposed, which returns an O(ln K)-approximate solution with a high probability, where K is the number of scenarios. This is the first approximation algorithm with better than K worst case ratio for the class of min-max combinatorial optimization problems with unbounded scenario set.

[1]  Eli Upfal,et al.  Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems , 2007, ICALP.

[2]  Adam Kasperski,et al.  On the approximability of minmax (regret) network optimization problems , 2008, Inf. Process. Lett..

[3]  Gang Yu,et al.  On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications , 1996, Oper. Res..

[4]  Naoki Katoh,et al.  Resource Allocation Problems , 1998 .

[5]  Daniel Vanderpooten,et al.  Approximating Min-Max (Regret) Versions of Some Polynomial Problems , 2006, COCOON.

[6]  K. Hamza.  The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions , 1995 .

[7]  Hiroshi Iida.  A Note on the Max-Min 0-1 Knapsack Problem , 1999, J. Comb. Optim..

[8]  Yang Jian,et al.  On the robust shortest path problem , 1998, Comput. Oper. Res..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Daniel Vanderpooten,et al.  Approximation of min-max and min-max regret versions of some combinatorial optimization problems , 2007, Eur. J. Oper. Res..

[11]  L. A. Pilipchuk,et al.  Network optimization problems , 2002 .

[12]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[13]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[14]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[15]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[16]  Igor Averbakh,et al.  On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..

[17]  Eduardo Conde,et al.  An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion , 2004, Math. Program..