Citáce podľa APA (7th ed.)

Maristany de las Casas, P., Sedeño-Noda, A., & Borndörfer, R. (2025). New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem. Computers & operations research, 173, 106852. https://doi.org/10.1016/j.cor.2024.106852

Citácia podle Chicago (17th ed.)

Maristany de las Casas, Pedro, Antonio Sedeño-Noda, a Ralf Borndörfer. "New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem." Computers & Operations Research 173 (2025): 106852. https://doi.org/10.1016/j.cor.2024.106852.

Citácia podľa MLA (8th ed.)

Maristany de las Casas, Pedro, et al. "New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem." Computers & Operations Research, vol. 173, 2025, p. 106852, https://doi.org/10.1016/j.cor.2024.106852.

Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..