Pages that link to "Item:Q2267304"
From MaRDI portal
The following pages link to A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304):
Displaying 11 items.
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion (Q1881565) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
- Approximating the min-max (regret) selecting items problem (Q1941689) (← links)
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
- Improved approximation algorithms for the Min-Max selecting items problem (Q2445242) (← links)
- The minimum expectation selection problem (Q4798168) (← links)
- Benchmarking problems for robust discrete optimization (Q6568403) (← links)
