Interval data minmax regret network optimization problems
type: Item
instance of: scholarly article
title: Interval data minmax regret network optimization problems
zbMATH Open document ID: 1056.90010
DOI: 10.1016/S0166-218X(03)00462-1
author: Igor Averbakh
author: Vasiliĭ N. Lebedev
published in: Discrete Applied Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 2083747
zbMATH Keywords: Minmax regret optimization
zbMATH Keywords: Spanning tree
zbMATH Keywords: Shortest path
MaRDI profile type: Publication
cites work: Q3056948
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: Q4198056
cites work: Robust discrete optimization and its applications
cites work: Q2753722
cites work: A branch and bound algorithm for the robust spanning tree problem with interval data
cites work: Robust Optimization of Large-Scale Systems
cites work: The robust spanning tree problem with interval data
description: scientific article; zbMATH DE number 2083747