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

Annals of Operations Research

Volumn 172, Issue 1, 2009, Pages 221-230

  Kasperski, Adam ^a   Zieliński, Pawelł ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Minmax; Randomized algorithm; Robust optimization; Selecting items

Indexed keywords

EID: 72249084123     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-009-0564-x     Document Type: Article

References (15)

1. Aissi, H., Bazgan, C., & Vanderpooten, D. (2006). Approximation of min-max (regret) versions of some polynomial problems. In Lecture notes in computer science: Vol. 4112. COCOON 2006 (pp. 428-438). Berlin: Springer.
2. Aissi, H., Bazgan, C., & Vanderpooten, D. (2007). Approximation of min-max and min-max regret versions of some combinatorial optimization problems. European Journal of Operational Research, 179, 281-290.
3. Averbakh, I. (2001). On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming, 90, 263-272.
4. Conde, E. (2004). An improved algorithm for selecting p items with uncertain returns according to the minmax regret criterion. Mathematical Programming, 100, 345-353.
5. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. A guide to the theory of NP-completeness. New York: Freeman.
6. Hamza, K. (1995). The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions. Statistics and Probability Letters, 23, 21-25.
7. Ibaraki, T., & Katoh, N. (1988). Resource allocation problems. Cambridge: MIT Press.
8. IIda, H. (2004). A note on the max-min 0-1 knapsack problem. Journal of Combinatorial Optimization, 3(1), 89-94.
9. Kasperski, A., & Zieliński, P. (2009). On the approximability of minmax (regret) network optimization problems. Information Processing Letters, 109, 262-266.
10. Katriel, I., Kenyon-Mathieu, C., & Upfal, E. (2007). Commitment under uncertainty: two-stage stochastic matching problems. In Lecture notes in computer science: Vol. 4596. ICALP 2007 (pp. 171-182). Berlin: Springer.
11. Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications. Dordrecht: Kluwer Academic.
12. Motwani, R., & Raghavan, P. (1995). Randomized algorithms. Cambridge: Cambridge University Press.
13. Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial optimization: algorithms and complexity. New York: Dover.
14. Yu, G. (1996). On the max-min 0-1 knapsack problem with robust optimization applications. Operations Research, 44(2), 407-415.
15. Yu, G., & Yang, J. (1998). On the robust shortest path problem. Computers and Operations Research, 25, 457-468.