Sciweavers

604 search results - page 24 / 121
» Stochastic Offline Programming
Sort
View
CSCLP
2005
Springer
15 years 4 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
AUTOMATICA
2011
14 years 6 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney
AAAI
2007
15 years 1 months ago
Solving a Stochastic Queueing Design and Control Problem with Constraint Programming
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
Daria Terekhov, J. Christopher Beck, Kenneth N. Br...
CPAIOR
2007
Springer
15 years 5 months ago
Solving a Stochastic Queueing Control Problem with Constraint Programming
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome...
Daria Terekhov, J. Christopher Beck
EOR
2008
200views more  EOR 2008»
14 years 11 months ago
A dynamic stochastic programming model for international portfolio management
We develop a multi-stage stochastic programming model for international portfolio management in a dynamic setting. We model uncertainty in asset prices and exchange rates in terms...
Nikolas Topaloglou, Hercules Vladimirou, Stavros A...