American Psychological Association 6th edition

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 and Applications: An International Journal, 85(2), 369-407. https://doi.org/10.1007/s10589-023-00474-3

ISO-690 (author-date, English)

ZHANG, Wenda, SAUPPE, Jason J. und JACOBSON, Sheldon H., 2023. Results for the close-enough traveling salesman problem with a branch-and-bound algorithm. Computational Optimization and Applications: An International Journal. 1 Juni 2023. Vol. 85, no. 2, p. 369-407. DOI 10.1007/s10589-023-00474-3.

Modern Language Association 9th edition

Zhang, W., J. J. Sauppe, und S. H. Jacobson. „Results for the Close-Enough Traveling Salesman Problem With a Branch-and-Bound Algorithm“. Computational Optimization and Applications: An International Journal, Bd. 85, Nr. 2, Juni 2023, S. 369-07, https://doi.org/10.1007/s10589-023-00474-3.

Mohr Siebeck - Recht (Deutsch - Österreich)

Zhang, Wenda/Sauppe, Jason J./Jacobson, Sheldon H.: Results for the close-enough traveling salesman problem with a branch-and-bound algorithm, Computational Optimization and Applications: An International Journal 2023, 369-407.

Emerald - Harvard

Zhang, W., Sauppe, J.J. und Jacobson, S.H. (2023), „Results for the close-enough traveling salesman problem with a branch-and-bound algorithm“, Computational Optimization and Applications: An International Journal, Vol. 85 No. 2, S. 369-407.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.