American Psychological Association 6th edition

Joung, S. (2025). Branch-and-cut algorithm for multiband robust discrete optimization problems. Optimization Letters, 1-36. https://doi.org/10.1007/s11590-025-02263-9

ISO-690 (author-date, English)

JOUNG, Seulgi, 2025. Branch-and-cut algorithm for multiband robust discrete optimization problems. Optimization Letters. 10 Dezember 2025. P. 1-36. DOI 10.1007/s11590-025-02263-9.

Modern Language Association 9th edition

Joung, S. „Branch-and-Cut Algorithm for Multiband Robust Discrete Optimization Problems“. Optimization Letters, Dezember 2025, S. 1-36, https://doi.org/10.1007/s11590-025-02263-9.

Mohr Siebeck - Recht (Deutsch - Österreich)

Joung, Seulgi: Branch-and-cut algorithm for multiband robust discrete optimization problems, Optimization Letters 2025, 1-36.

Emerald - Harvard

Joung, S. (2025), „Branch-and-cut algorithm for multiband robust discrete optimization problems“, Optimization Letters, S. 1-36.

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