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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 106; číslo 3; s. 423 - 432
Hlavní autoři:	Dyer, Martin, Stougie, Leen
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Heidelberg Springer 01.07.2006 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!