Pages that link to "Item:Q5171791"
From MaRDI portal
The following pages link to Recoverable Robust Combinatorial Optimization Problems (Q5171791):
Displaying 15 items.
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
- A biobjective approach to recoverable robustness based on location planning (Q1753588) (← 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)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Recoverable robust shortest path problems (Q2892155) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
