Sciweavers

952 search results - page 6 / 191
» Computational complexity of stochastic programming problems
Sort
View
MP
2006
100views more  MP 2006»
13 years 10 months ago
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, ...
MP
2008
103views more  MP 2008»
13 years 10 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
14 years 2 months ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu
WSC
2001
14 years 7 days ago
Monte Carlo simulation approach to stochastic programming
Various stochastic programmingproblemscan be formulated as problems of optimization of an expected value function. Quite often the corresponding expectation function cannot be com...
Alexander Shapiro
AAMAS
2010
Springer
13 years 11 months ago
Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...