Approximating the min-max (regret) selecting items problem
From MaRDI portal
Recommendations
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Improved approximation algorithms for the Min-Max selecting items problem
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Complexity of the min-max and min-max regret assignment problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- A Probabilistic Model for Minmax Regret in Combinatorial Optimization
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- On the complexity of minmax regret linear programming
Cited in
(28)- A state-of-the-art survey on multi-scenario scheduling
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
- Recoverable robust representatives selection problems with discrete budgeted uncertainty
- Robust approach to restricted items selection problem
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective
- Combinatorial optimization problems with balanced regret
- Risk-averse single machine scheduling: complexity and approximation
- The minimum expectation selection problem
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- On the minimax decision rules in ranking problems
- Efficient Algorithms for k-Regret Minimizing Sets
- Using the WOWA operator in robust discrete optimization problems
- Combinatorial two-stage minmax regret problems under interval uncertainty
- Robust single machine scheduling problem with weighted number of late jobs criterion
- Bin packing problem with scenarios
- Robust discrete optimization problems with the WOWA criterion
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- Improved approximation algorithms for the Min-Max selecting items problem
- Approximability of the robust representatives selection problem
- A computational study of approximation algorithms for a minmax resource allocation problem
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound
- Minimizing worst-case and average-case makespan over scenarios
- Robust recoverable and two-stage selection problems
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Combinatorial optimization problems with uncertain costs and the OWA criterion
This page was built for publication: Approximating the min-max (regret) selecting items problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941689)
