Pages that link to "Item:Q5171791"
From MaRDI portal
The following pages link to Recoverable Robust Combinatorial Optimization Problems (Q5171791):
Displayed 7 items.
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
- The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
- Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)