Restricted robust uniform matroid maximization under interval uncertainty
type: Item
instance of: scholarly article
title: Restricted robust uniform matroid maximization under interval uncertainty
zbMATH Open document ID: 1116.90080
author: Hande Yaman
author: Oya Ekin Karasan
author: Mustafa Ç. Pınar
published in: Mathematical Programming. Series A. Series B
publication date: 2007-05-10T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/23433
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 5151343
zbMATH Keywords: Uniform matroid
zbMATH Keywords: Robust optimization
zbMATH Keywords: Interval data
MaRDI profile type: Publication
OpenAlex ID: W1984332430
cites work: On the complexity of the robust spanning tree problem with interval data
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Robust convex optimization
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
cites work: Robust Solutions to Least-Squares Problems with Uncertain 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 branch and bound algorithm for the robust shortest path problem with interval data.
cites work: Q3813613
cites work: The robust spanning tree problem with interval data
cites work: The computational complexity of the relative robust shortest path problem with interval data
DOI: 10.1007/S10107-006-0008-1
description: scientific article; zbMATH DE number 5151343