American Psychological Association 6th edition

Mathieu, C., & Zhou, H. (2025). A tight (1.5+ϵ)-approximation for unsplittable capacitated vehicle routing on trees. Mathematical Programming: A Publication of the Mathematical Optimization Society, 212(1), 115-146. https://doi.org/10.1007/s10107-024-02094-z

ISO-690 (author-date, English)

MATHIEU, Claire und ZHOU, Hang, 2025. A tight (1.5+ϵ)-approximation for unsplittable capacitated vehicle routing on trees. Mathematical Programming: A Publication of the Mathematical Optimization Society. 1 Juli 2025. Vol. 212, no. 1, p. 115-146. DOI 10.1007/s10107-024-02094-z.

Modern Language Association 9th edition

Mathieu, C., und H. Zhou. „A Tight (1.5+ϵ)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees“. Mathematical Programming: A Publication of the Mathematical Optimization Society, Bd. 212, Nr. 1, Juli 2025, S. 115-46, https://doi.org/10.1007/s10107-024-02094-z.

Mohr Siebeck - Recht (Deutsch - Österreich)

Mathieu, Claire/Zhou, Hang: A tight (1.5+ϵ)-approximation for unsplittable capacitated vehicle routing on trees, Mathematical Programming: A Publication of the Mathematical Optimization Society 2025, 115-146.

Emerald - Harvard

Mathieu, C. und Zhou, H. (2025), „A tight (1.5+ϵ)-approximation for unsplittable capacitated vehicle routing on trees“, Mathematical Programming: A Publication of the Mathematical Optimization Society, Vol. 212 No. 1, S. 115-146.

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