Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds.

MLA

Jiang, Daniel R., et al. “Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds.” Operations Research, vol. 68, no. 6, Nov. 2020, pp. 1678–97. EBSCOhost, https://doi.org/10.1287/opre.2019.1939.

APA

Jiang, D. R., Al-Kanj, L., & Powell, W. B. (2020). Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds. Operations Research, 68(6), 1678–1697. https://doi.org/10.1287/opre.2019.1939

Chicago

Jiang, Daniel R., Lina Al-Kanj, and Warren B. Powell. 2020. “Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds.” Operations Research 68 (6): 1678–97. doi:10.1287/opre.2019.1939.