On recoverable and two-stage robust selection problems with budgeted uncertainty

DOI10.1016/j.ejor.2017.08.013zbMath1374.90321arXiv1701.06064OpenAlexW2582184501MaRDI QIDQ1681259

Paweł Zieliński, Marc Goerigk, Adam Kasperski, André B. Chassein

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

selection problemcombinatorial optimizationrobust optimizationbudgeted uncertaintyrecoverable robustnesstwo-stage robustness

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Two-stage robust optimization problems with two-stage uncertainty ⋮ Recoverable robust representatives selection problems with discrete budgeted uncertainty ⋮ Robust combinatorial optimization with locally budgeted uncertainty ⋮ Multistage robust discrete optimization via quantified integer programming ⋮ Minimizing maximum cost for a single machine under uncertainty of processing times ⋮ Robust recoverable 0-1 optimization problems under polyhedral uncertainty ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty ⋮ Combinatorial optimization problems with balanced regret ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty ⋮ 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 ⋮ Robust multicovers with budgeted uncertainty ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ An alternative efficient representation for the project portfolio selection problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the recoverable robust traveling salesman problem
• Recoverable robust knapsacks: the discrete scenario case
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Commitment under uncertainty: Two-stage stochastic matching problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robustness in operational research and decision aiding: a multi-faceted issue
• The most vital edges in the minimum spanning tree problem
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Approximating the min-max (regret) selecting items problem
• Recent advances in robust optimization: an overview
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• Recoverable robust spanning tree problem under interval uncertainty representations
• Improved approximation algorithms for the Min-Max selecting items problem
• Recoverable robust shortest path problems
• Incremental Network Optimization: Theory and Algorithms
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Increasing the Weight of Minimum Spanning Trees
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: On recoverable and two-stage robust selection problems with budgeted uncertainty