Minmax regret bottleneck problems with solution-induced interval uncertainty structure
type: Item
instance of: scholarly article
title: Minmax regret bottleneck problems with solution-induced interval uncertainty structure
zbMATH Open document ID: 1241.90177
author: Igor Averbakh
published in: Discrete Optimization
publication date: 2012-06-20T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6048236
zbMATH Keywords: minmax regret optimization
zbMATH Keywords: robust optimization
zbMATH Keywords: data uncertainty
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: bottleneck problems
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.03.007
OpenAlex ID: W2074338624
cites work: Complexity of the min-max and min-max regret assignment problems
cites work: On the complexity of the robust spanning tree problem with interval data
cites work: Minmax regret solutions for minimax optimization problems with uncertainty
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 improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
cites work: On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
cites work: Minimax regret spanning arborescences under uncertain costs
cites work: The robust spanning tree problem with interval data
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: On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
cites work: Robust discrete optimization and its applications
cites work: A branch and bound algorithm for the robust spanning tree problem with interval data
cites work: A Benders decomposition approach for the robust spanning tree problem with interval data
cites work: Restricted robust uniform matroid maximization under interval uncertainty
cites work: The computational complexity of the relative robust shortest path problem with interval data
cites work: Robust convex optimization
cites work: Robust discrete optimization and network flows
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Robust Optimization of Large-Scale Systems
cites work: Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
cites work: Q4111952
cites work: Q4091421
cites work: Q3056948
DOI: 10.1016/J.DISOPT.2010.03.007
description: scientific article; zbMATH DE number 6048236