Approximating the min-max (regret) selecting items problem
From MaRDI portal
Publication:1941689
DOI10.1016/j.ipl.2012.10.001zbMath1259.68237OpenAlexW2077975330MaRDI QIDQ1941689
Paweł Zieliński, Adam Kurpisz, Adam Kasperski
Publication date: 21 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.10.001
computational complexitycombinatorial problemsrobust optimizationapproximation algorithmsmin-max regret
Related Items (19)
Single machine scheduling problems with uncertain parameters and the OWA criterion ⋮ A parameterized view to the robust recoverable base problem of matroids under structural uncertainty ⋮ Recoverable robust representatives selection problems with discrete budgeted uncertainty ⋮ Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound ⋮ Robust recoverable and two-stage selection problems ⋮ On recoverable and two-stage robust selection problems with budgeted uncertainty ⋮ Bin packing problem with scenarios ⋮ Using the WOWA operator in robust discrete optimization problems ⋮ Complexity results for common due date scheduling problems with interval data and minmax regret criterion ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective ⋮ Combinatorial optimization problems with balanced regret ⋮ Minimizing worst-case and average-case makespan over scenarios ⋮ Improved approximation algorithms for the Min-Max selecting items problem ⋮ Combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ Robust Discrete Optimization Problems with the WOWA Criterion ⋮ Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion
This page was built for publication: Approximating the min-max (regret) selecting items problem
