Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
type: Item
instance of: scholarly article
title: Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
zbMATH Open document ID: 1160.90628
author: Hassene Aissi
published in: 4OR
publication date: 2007-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5156792
zbMATH Keywords: min-max
zbMATH Keywords: min-max regret
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: complexity
zbMATH Keywords: approximation
zbMATH Keywords: robustness analysis
zbMATH Keywords: data association
MaRDI profile type: Publication
full work available at URL: s10288-006-0004-6
OpenAlex ID: W2094229276
cites work: Complexity of the min-max and min-max regret assignment problems
cites work: Algorithms – ESA 2005
cites work: Algorithms and Computation
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Interval data minmax regret network optimization problems
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: Robust discrete optimization and its applications
cites work: A Benders decomposition approach for the robust spanning tree problem with interval data
cites work: The robust shortest path problem with interval data via Benders decomposition
cites work: A new relaxation algorithm and passive sensor data association
DOI: 10.1007/S10288-006-0004-6
description: scientific article; zbMATH DE number 5156792