Restricted robust uniform matroid maximization under interval uncertainty

DOI10.1007/s10107-006-0008-1zbMath1116.90080OpenAlexW1984332430MaRDI QIDQ879971

Hande Yaman, Oya Ekin Karaşan, Mustafa Çelebi Pinar

Publication date: 10 May 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23433

zbMATH Keywords

Interval dataRobust optimizationUniform matroid

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items (11)

A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ A double oracle approach to minmax regret optimization problems with interval data ⋮ Portfolio selection under uncertainty: a new methodology for computing relative‐robust solutions ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ Minmax regret bottleneck problems with solution-induced interval uncertainty structure ⋮ Formulation and algorithms for the robust maximal covering location problem ⋮ A unified approach to uncertain optimization ⋮ Robust optimization of contaminant sensor placement for community water systems ⋮ A minmax regret approach to the critical path method with task interval times

Cites Work

• The computational complexity of the relative robust shortest path problem with interval data
• A branch and bound algorithm for the robust spanning tree problem with interval data
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• A branch and bound algorithm for the robust shortest path problem with interval data.
• On the complexity of the robust spanning tree problem with interval data
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• Lectures on Modern Convex Optimization
• Robust Convex Optimization
• The Price of Robustness
• Robust Solutions to Least-Squares Problems with Uncertain Data
• On the complexity of a class of combinatorial optimization problems with uncertainty
• The robust spanning tree problem with interval data
• Unnamed Item

This page was built for publication: Restricted robust uniform matroid maximization under interval uncertainty