Diao, R., Liu, Y., & Dai, Y. (2017). A new fully polynomial time approximation scheme for the interval subset sum problem. Journal of global optimization, 68(4), 749-775. https://doi.org/10.1007/s10898-017-0514-0
Citace podle Chicago (17th ed.)Diao, Rui, Ya-Feng Liu, a Yu-Hong Dai. "A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem." Journal of Global Optimization 68, no. 4 (2017): 749-775. https://doi.org/10.1007/s10898-017-0514-0.
Citace podle MLA (9th ed.)Diao, Rui, et al. "A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem." Journal of Global Optimization, vol. 68, no. 4, 2017, pp. 749-775, https://doi.org/10.1007/s10898-017-0514-0.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..