Min–max–min robust combinatorial optimization
- 14 July 2016
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 163 (1-2) , 1-23
Abstract
No abstract availableKeywords
Funding Information
- DFG (GRK1855)
This publication has 16 references indexed in Scilit:
- Recoverable robust shortest path problemsNetworks, 2011
- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization2010
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications2009
- Adjustable robust solutions of uncertain linear programsMathematical Programming, 2004
- The Price of RobustnessOperations Research, 2004
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Robust Convex OptimizationMathematics of Operations Research, 1998
- Robust Solutions to Least-Squares Problems with Uncertain DataSIAM Journal on Matrix Analysis and Applications, 1997
- Infinitely constrained optimization problemsJournal of Optimization Theory and Applications, 1976
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear ProgrammingOperations Research, 1973