APA (7th ed.) Citation

Zhang, W., Sauppe, J. J., & Jacobson, S. H. (2023). Results for the close-enough traveling salesman problem with a branch-and-bound algorithm. Computational Optimization & Applications, 85(2), 369. https://doi.org/10.1007/s10589-023-00474-3

Chicago Style (17th ed.) Citation

Zhang, Wenda, Jason J. Sauppe, and Sheldon H. Jacobson. "Results for the Close-enough Traveling Salesman Problem with a Branch-and-bound Algorithm." Computational Optimization & Applications 85, no. 2 (2023): 369. https://doi.org/10.1007/s10589-023-00474-3.

MLA (9th ed.) Citation

Zhang, Wenda, et al. "Results for the Close-enough Traveling Salesman Problem with a Branch-and-bound Algorithm." Computational Optimization & Applications, vol. 85, no. 2, 2023, p. 369, https://doi.org/10.1007/s10589-023-00474-3.