American Psychological Association 6th edition

Jin, B., Klein, N., & Williamson, D. P. (2025). A 43-approximation algorithm for half-integral cycle cut instances of the TSP. Mathematical Programming: A Publication of the Mathematical Optimization Society, 1-28. https://doi.org/10.1007/s10107-025-02193-5

ISO-690 (author-date, English)

JIN, Billy, KLEIN, Nathan und WILLIAMSON, David P., 2025. A 43-approximation algorithm for half-integral cycle cut instances of the TSP. Mathematical Programming: A Publication of the Mathematical Optimization Society. 17 Februar 2025. P. 1-28. DOI 10.1007/s10107-025-02193-5.

Modern Language Association 9th edition

Jin, B., N. Klein, und D. P. Williamson. „A 43-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP“. Mathematical Programming: A Publication of the Mathematical Optimization Society, Februar 2025, S. 1-28, https://doi.org/10.1007/s10107-025-02193-5.

Mohr Siebeck - Recht (Deutsch - Österreich)

Jin, Billy/Klein, Nathan/Williamson, David P.: A 43-approximation algorithm for half-integral cycle cut instances of the TSP, Mathematical Programming: A Publication of the Mathematical Optimization Society 2025, 1-28.

Emerald - Harvard

Jin, B., Klein, N. und Williamson, D.P. (2025), „A 43-approximation algorithm for half-integral cycle cut instances of the TSP“, Mathematical Programming: A Publication of the Mathematical Optimization Society, S. 1-28.

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