Pages that link to "Item:Q2515045"
From MaRDI portal
The following pages link to Bulk-robust combinatorial optimization (Q2515045):
Displaying 14 items.
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
- Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
- Decision space robustness for multi-objective integer linear programming (Q2108813) (← links)
- Flexible graph connectivity (Q2118137) (← links)
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
- Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
- (Q4414639) (← links)
- Flexible Graph Connectivity (Q5041731) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- How to Secure Matchings against Edge Failures (Q5157391) (← links)
- A generic optimization framework for resilient systems (Q5882239) (← links)
- A \((B + 1)\)-approximation for network flow interdiction with unit costs (Q6558673) (← links)
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)