Approximating the min–max (regret) selecting items problem
Authors:
- Adam KasperskiAKAdam Kasperski
- Adam KurpiszAKAdam Kurpisz
- Paweł ZielińskiPZPaweł Zieliński
- 1 January 2013
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 113 (1-2) , 23-29
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Min–max and min–max regret versions of combinatorial optimization problems: A surveyEuropean Journal of Operational Research, 2009
- A randomized algorithm for the min-max selecting items problem with uncertain weightsAnnals of Operations Research, 2009
- An Extension of the Lovász Local Lemma, and its Applications to Integer ProgrammingSIAM Journal on Computing, 2006
- An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterionMathematical Programming, 2004
- On Multidimensional Packing ProblemsSIAM Journal on Computing, 2004
- On the complexity of a class of combinatorial optimization problems with uncertaintyMathematical Programming, 2001
- Improved Approximation Guarantees for Packing and Covering Integer ProgramsSIAM Journal on Computing, 1999
- Robust Discrete Optimization and Its Applications1997
- Single machine scheduling to minimize the number of early and tardy jobsComputers & Operations Research, 1996
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988