2017
DOI: 10.1016/j.ejor.2016.10.009
|View full text |Cite
|
Sign up to set email alerts
|

Massively parallel processing of recursive multi-period portfolio models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 54 publications
0
1
0
Order By: Relevance
“…[10] informs that finding a multiperiod portfolio optimization solution is very difficult and complicated. Nevertheless, then along with the development of computers can help solve these problems, including using dynamic programming with the Bellman equation [4], the Monte Carlo algorithm [11], and parallel processing [12].…”
Section: Introductionmentioning
confidence: 99%
“…[10] informs that finding a multiperiod portfolio optimization solution is very difficult and complicated. Nevertheless, then along with the development of computers can help solve these problems, including using dynamic programming with the Bellman equation [4], the Monte Carlo algorithm [11], and parallel processing [12].…”
Section: Introductionmentioning
confidence: 99%