Dyer, M., & Stougie, L. (2006). Computational complexity of stochastic programming problems. Mathematical programming, 106(3), 423-432. https://doi.org/10.1007/s10107-005-0597-0
Citace podle Chicago (17th ed.)Dyer, Martin, a Leen Stougie. "Computational Complexity of Stochastic Programming Problems." Mathematical Programming 106, no. 3 (2006): 423-432. https://doi.org/10.1007/s10107-005-0597-0.
Citace podle MLA (9th ed.)Dyer, Martin, a Leen Stougie. "Computational Complexity of Stochastic Programming Problems." Mathematical Programming, vol. 106, no. 3, 2006, pp. 423-432, https://doi.org/10.1007/s10107-005-0597-0.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..