A randomized algorithm for the min-max selecting items problem with uncertain weights
- 26 May 2009
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 172 (1) , 221-230
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the approximability of minmax (regret) network optimization problemsInformation Processing Letters, 2009
- Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems2007
- Approximation of min–max and min–max regret versions of some combinatorial optimization problemsEuropean Journal of Operational Research, 2007
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems2006
- An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterionMathematical Programming, 2004
- On the complexity of a class of combinatorial optimization problems with uncertaintyMathematical Programming, 2001
- A Note on the Max-Min 0-1 Knapsack ProblemJournal of Combinatorial Optimization, 1999
- Robust Discrete Optimization and Its Applications1997
- Randomized Algorithms1995
- The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributionsStatistics & Probability Letters, 1995