Restricted robust uniform matroid maximization under interval uncertainty

DOI10.1007/S10107-006-0008-1zbMATH Open1116.90080OpenAlexW1984332430MaRDI QIDQ879971FDOQ879971

Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pınar

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

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

Cites Work

• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• The Price of Robustness
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust convex optimization
• A branch and bound algorithm for the robust shortest path problem with interval data.
• On the complexity of a class of combinatorial optimization problems with uncertainty
• The robust spanning tree problem with interval data
• On the complexity of the robust spanning tree problem with interval data
• A branch and bound algorithm for the robust spanning tree problem with interval data
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• The computational complexity of the relative robust shortest path problem with interval data

Cited In (12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879971)