Min-max and min-max (relative) regret approaches to representatives selection problem
type: Item
instance of: scholarly article
title: Min-max and min-max (relative) regret approaches to representatives selection problem
zbMATH Open document ID: 1266.90191
author: Sergey Kovalev
author: Alexandre Dolgui
published in: 4OR
publication date: 2013-02-06T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 62F35
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6134734
zbMATH Keywords: uncertainty
zbMATH Keywords: min-max approach
zbMATH Keywords: min-max regret
zbMATH Keywords: computational complexity
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: s10288-012-0202-3
OpenAlex ID: W2044046971
cites work: Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
cites work: Complexity of the min-max and min-max regret assignment problems
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
cites work: Minimizing the number of late jobs on a single machine under due date uncertainty
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Computing and minimizing the relative regret in combinatorial optimization with interval data
cites work: An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
cites work: Optimisation of multi-position machines and transfer lines
cites work: Combinatorial and robust optimisation models and algorithms for railway applications
cites work: Q4198056
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: The robust shortest path problem in series -- parallel multidigraphs with interval data
cites work: A randomized algorithm for the min-Max selecting items problem with uncertain weights
cites work: On the approximability of minmax (regret) network optimization problems
cites work: Improving the complexities of approximation algorithms for optimization problems
cites work: Robust discrete optimization and its applications
cites work: The robust shortest path problem with interval data via Benders decomposition
cites work: Robustness in operational research and decision aiding: a multi-faceted issue
cites work: Robust portfolio asset allocation and risk measures
cites work: Robust balancing of mixed model assembly line
cites work: On the robust shortest path problem.
DOI: 10.1007/S10288-012-0202-3
Recommended article: Approximating the min-max (regret) selecting items problem
Recommended article: Min max min robust (relative) regret combinatorial optimization
Recommended article: Minmax regret combinatorial optimization problems: an Algorithmic Perspective
Recommended article: Complexity of the min-max and min-max regret assignment problems
Recommended article: Min-max and min-max regret versions of combinatorial optimization problems: A survey
Recommended article: Approximation of min-max and min-max regret versions of some combinatorial optimization problems
Recommended article: Approximability of the robust representatives selection problem
Recommended article: A representation theorem for minmax regret policies
Recommended article: Q3616140
Recommended article: A Probabilistic Model for Minmax Regret in Combinatorial Optimization
description: scientific article; zbMATH DE number 6134734