Pages that link to "Item:Q2445242"
From MaRDI portal
The following pages link to Improved approximation algorithms for the Min-Max selecting items problem (Q2445242):
Displayed 7 items.
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← links)
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion (Q2806942) (← links)