Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty
Open Access
- 3 June 2006
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 110 (2) , 431-441
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A branch and bound algorithm for the robust spanning tree problem with interval dataEuropean Journal of Operational Research, 2005
- An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterionMathematical Programming, 2004
- The Price of RobustnessOperations Research, 2004
- On the complexity of the robust spanning tree problem with interval dataOperations Research Letters, 2004
- Robust discrete optimization and network flowsMathematical Programming, 2003
- On the complexity of a class of combinatorial optimization problems with uncertaintyMathematical Programming, 2001
- Robust Convex OptimizationMathematics of Operations Research, 1998
- A New Mixed Integer Formulation for the Maximum Regret ProblemInternational Transactions in Operational Research, 1998
- Robust Solutions to Least-Squares Problems with Uncertain DataSIAM Journal on Matrix Analysis and Applications, 1997
- Robust Discrete Optimization and Its Applications1997