Pages that link to "Item:Q1941689"
From MaRDI portal
The following pages link to Approximating the min-max (regret) selecting items problem (Q1941689):
Displaying 27 items.
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- Robust approach to restricted items selection problem (Q828685) (← links)
- Using the WOWA operator in robust discrete optimization problems (Q895514) (← links)
- On the minimax decision rules in ranking problems (Q1380646) (← links)
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← 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)
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
- Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
- Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Bin packing problem with scenarios (Q2418155) (← 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)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- Robust Discrete Optimization Problems with the WOWA Criterion (Q2806941) (← links)
- Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion (Q2806942) (← links)
- Efficient Algorithms for k-Regret Minimizing Sets (Q4580150) (← links)
- The minimum expectation selection problem (Q4798168) (← links)
- A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
- Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective (Q6113355) (← links)
