ISO-690 (author-date, English)

BARKEL, Mathijs, DELORME, Maxence, MALAGUTI, Enrico und MONACI, Michele, 2025. Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation. INFORMS Journal on Computing. 19 August 2025. P. 1-16. DOI 10.1287 joc.2024.0972.

Elsevier - Harvard (with titles)

Barkel, M., Delorme, M., Malaguti, E., Monaci, M., 2025. Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation. INFORMS Journal on Computing 1-16. https://doi.org/10.1287 joc.2024.0972

American Psychological Association 7th edition

Barkel, M., Delorme, M., Malaguti, E., & Monaci, M. (2025). Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation. INFORMS Journal on Computing, 1-16. https://doi.org/10.1287 joc.2024.0972

Springer - Basic (author-date)

Barkel M, Delorme M, Malaguti E, Monaci M (2025) Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation.. INFORMS Journal on Computing 1-16. https://doi.org/10.1287 joc.2024.0972

Juristische Zitierweise (Stüber) (Deutsch)

Barkel, Mathijs/ Delorme, Maxence/ Malaguti, Enrico/ Monaci, Michele, Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation., INFORMS Journal on Computing 2025, 1-16.

Bitte prüfen Sie die Zitate auf Korrektheit, bevor Sie diese in Ihre Arbeit einfügen.