Approximating the min-max (regret) selecting items problem
type: Item
instance of: scholarly article
title: Approximating the min-max (regret) selecting items problem
zbMATH Open document ID: 1259.68237
author: Adam Kasperski
author: Adam Kurpisz
author: Paweł Zieliński
published in: Information Processing Letters
publication date: 2013-03-21T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6147759
zbMATH Keywords: robust optimization
zbMATH Keywords: combinatorial problems
zbMATH Keywords: approximation algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: min-max regret
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.10.001
OpenAlex ID: W2077975330
DOI: 10.1016/J.IPL.2012.10.001
Recommended article: Approximation of min-max and min-max regret versions of some combinatorial optimization problems
Recommended article: Improved approximation algorithms for the Min-Max selecting items problem
Recommended article: Minmax regret combinatorial optimization problems: an Algorithmic Perspective
Recommended article: Min-max and min-max (relative) regret approaches to representatives selection problem
Recommended article: Complexity of the min-max and min-max regret assignment problems
Recommended article: An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
Recommended article: A Probabilistic Model for Minmax Regret in Combinatorial Optimization
Recommended article: A randomized algorithm for the min-Max selecting items problem with uncertain weights
Recommended article: An approximation algorithm for interval data minmax regret combinatorial optimization problems
Recommended article: On the complexity of minmax regret linear programming
description: scientific article; zbMATH DE number 6147759