On the robustness of optimal solutions for combinatorial optimization problems
From MaRDI portal
Recommendations
- A note on robustness tolerances for combinatorial optimization problems
- scientific article; zbMATH DE number 1852192
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
- On the accuracy function and the accuracy radius for combinatorial optimization problems
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
Cited in
(10)- Size versus truncation robustness in the assignment problem
- A note on robustness tolerances for combinatorial optimization problems
- From Optimality Robustness To Sufficiency and Completeness
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
- scientific article; zbMATH DE number 1852192 (Why is no real title available?)
- Generating hard instances for robust combinatorial optimization
- On scenario aggregation to approximate robust combinatorial optimization problems
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
- Recoverable Robust Combinatorial Optimization Problems
- Complexity and in-approximability of a selection problem in robust optimization
This page was built for publication: On the robustness of optimal solutions for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2932929)
