Robust network optimization under polyhedral demand uncertainty is -hard
Author:
- M. MinouxMMM. Minoux
- 1 March 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (5) , 597-603
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- An approach to robust network design in telecommunicationsRAIRO - Operations Research, 2007
- Robust capacity expansion of network flowsNetworks, 2007
- Routing of Uncertain Traffic DemandsOptimization and Engineering, 2005
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Optimum Network Design Models and Algorithms in Transportation and CommunicationInternational Journal of Logistics Research and Applications, 2003
- Robust optimization ? methodology and applicationsMathematical Programming, 2002
- Robust solutions of uncertain linear programsOperations Research Letters, 1999
- A robustness approach to uncapacitated network design problemsEuropean Journal of Operational Research, 1996
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- A theorem on flows in networksPacific Journal of Mathematics, 1957