Pages that link to "Item:Q1785311"
From MaRDI portal
The following pages link to Approximability of the robust representatives selection problem (Q1785311):
Displaying 10 items.
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Robust approach to restricted items selection problem (Q828685) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← 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)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- Representative scenario construction and preprocessing for robust combinatorial optimization problems (Q2329662) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
- Benchmarking problems for robust discrete optimization (Q6568403) (← links)
- Approximating the shortest path problem with scenarios (Q6652474) (← links)
