Pages that link to "Item:Q385465"
From MaRDI portal
The following pages link to Complexity and in-approximability of a selection problem in robust optimization (Q385465):
Displaying 8 items.
- Robust approach to restricted items selection problem (Q828685) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
- Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
