Robust recoverable and two-stage selection problems

DOI10.1016/j.dam.2017.08.014zbMath1382.90088arXiv1505.06893OpenAlexW2963875387MaRDI QIDQ2410249

Adam Kasperski, Paweł Zieliński

Publication date: 17 October 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.06893

zbMATH Keywords

computational complexityselection problemrobust optimizationapproximation algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Mid-term capacity redeployment of Rescue Centers under simultaneous requirements ⋮ Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Flexible here-and-now decisions for two-stage multi-objective optimization: method and application to energy system design selection ⋮ Two-stage robust optimization problems with two-stage uncertainty ⋮ A parameterized view to the robust recoverable base problem of matroids under structural uncertainty ⋮ Recoverable robust representatives selection problems with discrete budgeted uncertainty ⋮ Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective ⋮ Robust recoverable 0-1 optimization problems under polyhedral uncertainty ⋮ Combinatorial optimization problems with balanced regret ⋮ On the complexity of robust multi-stage problems with discrete recourse ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ A linear time algorithm for the robust recoverable selection problem ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ Two-stage combinatorial optimization problems under risk ⋮ Decision space robustness for multi-objective integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the recoverable robust traveling salesman problem
• On the approximability of robust spanning tree problems
• On two-stage stochastic knapsack problems
• Recoverable robust knapsacks: the discrete scenario case
• Commitment under uncertainty: Two-stage stochastic matching problems
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• Approximating the min-max (regret) selecting items problem
• A randomized algorithm for the min-Max selecting items problem with uncertain weights
• Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
• Recoverable robust spanning tree problem under interval uncertainty representations
• Improved approximation algorithms for the Min-Max selecting items problem
• Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
• Recoverable robust shortest path problems
• Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Stochastic maximum weight forest problem
• On the complexity of a class of combinatorial optimization problems with uncertainty