Halman, N., Li, C., & Simchi-Levi, D. (2009). Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks. Operations research letters, 37(4), 239-244. https://doi.org/10.1016/j.orl.2009.03.002
Citace podle Chicago (17th ed.)Halman, Nir, Chung-Lun Li, a David Simchi-Levi. "Fully Polynomial-time Approximation Schemes for Time–cost Tradeoff Problems in Series–parallel Project Networks." Operations Research Letters 37, no. 4 (2009): 239-244. https://doi.org/10.1016/j.orl.2009.03.002.
Citace podle MLA (9th ed.)Halman, Nir, et al. "Fully Polynomial-time Approximation Schemes for Time–cost Tradeoff Problems in Series–parallel Project Networks." Operations Research Letters, vol. 37, no. 4, 2009, pp. 239-244, https://doi.org/10.1016/j.orl.2009.03.002.