Robust recoverable and two-stage selection problems

In this paper the following selection problem is discussed. A set of $n$ items is given and we wish to choose a subset of exactly $p$ items of the minimum total cost. This problem is a special case of 0-1 knapsack in which all the item weights are equal to~1. Its deterministic version has a trivial $O(n)$-time algorithm, which consists in choosing $p$ items of the smallest costs. In this paper it is assumed that the item costs are uncertain. Two robust models, namely two-stage and recoverable ones, under discrete and interval uncertainty representations, are discussed. Several positive and negative complexity results for both of them are provided.

[1]  Mohit Singh,et al.  How to pay, come what may: approximation algorithms for demand-robust covering problems , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[2]  Adam Kurpisz,et al.  Approximating the min-max (regret) selecting items problem , 2013, Inf. Process. Lett..

[3]  Olivier Spanjaard,et al.  Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation , 2010, Eur. J. Oper. Res..

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

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

[6]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[7]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

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

[9]  Abdel Lisser,et al.  Stochastic maximum weight forest problem , 2015, Networks.

[10]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[11]  Arie M. C. A. Koster,et al.  Recoverable robust knapsacks: the discrete scenario case , 2011, Optim. Lett..

[12]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[13]  David Steurer,et al.  Analytical approach to parallel repetition , 2013, STOC.

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

[15]  Stefanie Kosuch,et al.  Approximability of the two-stage stochastic knapsack problem with discretely distributed weights , 2014, Discret. Appl. Math..

[16]  Eli Upfal,et al.  Commitment under uncertainty: Two-stage stochastic matching problems , 2007, Theor. Comput. Sci..

[17]  Christina Büsing.  Recoverable robust shortest path problems , 2012, Networks.

[18]  Rolf H. Möhring,et al.  The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.

[19]  Abdel Lisser,et al.  On two-stage stochastic knapsack problems , 2011, Discret. Appl. Math..

[20]  Gareth Johnson,et al.  How to pay , 2011 .

[21]  Adam Kasperski,et al.  On the approximability of robust spanning tree problems , 2010, Theor. Comput. Sci..

[22]  Benjamin Doerr.  Improved approximation algorithms for the Min-Max Selecting Items problem , 2013, Inf. Process. Lett..

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

[24]  Christoph Buchheim,et al.  A Lagrangean Decomposition Approach for Robust Combinatorial Optimization ? , 2014 .

[25]  Rosella Parsons,et al.  How to pay , 2014 .

[26]  Adam Kasperski,et al.  A randomized algorithm for the min-max selecting items problem with uncertain weights , 2009, Ann. Oper. Res..

[27]  Adam Kasperski,et al.  Recoverable robust spanning tree problem under interval uncertainty representations , 2017, J. Comb. Optim..

[28]  Christoph Buchheim,et al.  Lagrangean Decomposition for Mean-Variance Combinatorial Optimization , 2014, ISCO.

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

[30]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[31]  Marc Goerigk,et al.  On the recoverable robust traveling salesman problem , 2016, Optim. Lett..

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

[33]  Ebrahim Nasrabadi,et al.  Robust optimization with incremental recourse , 2013, ArXiv.