APA (7th ed.) Citation

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

Chicago Style (17th ed.) Citation

Diao, Rui, Ya-Feng Liu, and 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.

MLA (9th ed.) Citation

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.