A comment on “computational complexity of stochastic programming problems”
- 22 October 2015
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 159 (1-2) , 557-569
Abstract
No abstract availableKeywords
Funding Information
- Engineering and Physical Sciences Research Council (GB) (EP/I014640/1)
This publication has 8 references indexed in Scilit:
- Quasi-Monte Carlo methods for linear two-stage stochastic programming problemsMathematical Programming, 2015
- On Complexity of Stochastic Programming Problems2006
- Computational complexity of stochastic programming problemsMathematical Programming, 2005
- When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?Journal of Complexity, 1998
- Stochastic Programming1995
- Counting linear extensionsOrder, 1991
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, 1988
- On inverses of Vandermonde and confluent Vandermonde matricesNumerische Mathematik, 1962