Cite
Inverse max+sum spanning tree problem under weighted l1 norm by modifying the sum-cost vector.
MLA
Guan, Xiucui, et al. “Inverse Max+sum Spanning Tree Problem under Weighted L1 Norm by Modifying the Sum-Cost Vector.” Optimization Letters, vol. 12, no. 5, July 2018, pp. 1065–77. EBSCOhost, https://doi.org/10.1007/s11590-017-1165-2.
APA
Guan, X., Pardalos, P. M., & Zhang, B. (2018). Inverse max+sum spanning tree problem under weighted l1 norm by modifying the sum-cost vector. Optimization Letters, 12(5), 1065–1077. https://doi.org/10.1007/s11590-017-1165-2
Chicago
Guan, Xiucui, Panos M. Pardalos, and Binwu Zhang. 2018. “Inverse Max+sum Spanning Tree Problem under Weighted L1 Norm by Modifying the Sum-Cost Vector.” Optimization Letters 12 (5): 1065–77. doi:10.1007/s11590-017-1165-2.