Recoverable Robust Combinatorial Optimization Problems
From MaRDI portal
Recommendations
- Decomposition approaches for recoverable robust optimization problems
- On the robustness of optimal solutions for combinatorial optimization problems
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty
- scientific article; zbMATH DE number 764410
- Dynamic algorithms for recoverable robustness problems
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- On the recoverable robust traveling salesman problem
- Robust Combinatorial Optimization with Exponential Scenarios
- A note on robustness tolerances for combinatorial optimization problems
Cited in
(19)- A note on robustness tolerances for combinatorial optimization problems
- Recoverable robust shortest path problems
- A biobjective approach to recoverable robustness based on location planning
- Recoverable robust prize-collecting call control problem
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Robust recoverable and two-stage selection problems
- Bulk-robust combinatorial optimization
- Minimizing recovery cost of network optimization problems
- Recoverable robust spanning tree problem under interval uncertainty representations
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
- Recoverable robust representatives selection problems with discrete budgeted uncertainty
- On the recoverable robust traveling salesman problem
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Recycling inequalities for robust combinatorial optimization with budget uncertainty
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Complexity of the directed robust b-matching problem and its variants on different graph classes
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty
This page was built for publication: Recoverable Robust Combinatorial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171791)
