American Psychological Association 6th edition

Barkel, M., Delorme, M., Malaguti, E., & Monaci, M. (2025). Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation. European Journal of Operational Research, 320(1), 57-68. https://doi.org/10.1016/j.ejor.2024.08.007

ISO-690 (author-date, English)

BARKEL, Mathijs, DELORME, Maxence, MALAGUTI, Enrico und MONACI, Michele, 2025. Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation. European Journal of Operational Research. 1 Januar 2025. Vol. 320, no. 1, p. 57-68. DOI 10.1016/j.ejor.2024.08.007.

Modern Language Association 9th edition

Barkel, M., M. Delorme, E. Malaguti, und M. Monaci. „Bounds and Heuristic Algorithms for the Bin Packing Problem With Minimum Color Fragmentation.“. European Journal of Operational Research, Bd. 320, Nr. 1, Januar 2025, S. 57-68, https://doi.org/10.1016/j.ejor.2024.08.007.

Mohr Siebeck - Recht (Deutsch - Österreich)

Barkel, Mathijs/Delorme, Maxence/Malaguti, Enrico/Monaci, Michele: Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation., European Journal of Operational Research 2025, 57-68.

Emerald - Harvard

Barkel, M., Delorme, M., Malaguti, E. und Monaci, M. (2025), „Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation.“, European Journal of Operational Research, Vol. 320 No. 1, S. 57-68.

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