On the complexity of minmax regret linear programming
type: Item
instance of: scholarly article
title: On the complexity of minmax regret linear programming
zbMATH Open document ID: 1067.90132
author: Igor Averbakh
author: Vasiliĭ N. Lebedev
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 2117501
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Complexity theory
zbMATH Keywords: Uncertainty modeling
zbMATH Keywords: Minmax regret optimization
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.07.007
OpenAlex ID: W2089510325
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Q4198056
cites work: Minimax regret solution to linear programming problems with an interval objective function
cites work: A possibilistic linear program is equivalent to a stochastic linear program in a special case
cites work: A new polynomial-time algorithm for linear programming
cites work: Q4197641
cites work: A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
cites work: The complexity of satisfiability problems
DOI: 10.1016/J.EJOR.2003.07.007
description: scientific article; zbMATH DE number 2117501