Computational complexity of stochastic programming problems

Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast quantity of literature on the subject has appeared. Developments in the theory of computational complexity allow us to establish the theo...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 106; no. 3; pp. 423 - 432
Main Authors:	Dyer, Martin, Stougie, Leen
Format:	Journal Article
Language:	English
Published:	Heidelberg Springer 01.07.2006 Springer Nature B.V
Subjects:	Applied sciences Exact sciences and technology Integer programming Linear programming Mathematical programming Operational research and scientific management Operational research. Management science Optimization Optimization techniques Phase transitions Random variables Stochastic models Studies Uncertain system Probabilistic approach Computational complexity Distributed parameter system Mathematical programming Stochastic programming
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!