APA (7th ed.) Citation

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

Chicago Style (17th ed.) Citation

Maristany de las Casas, Pedro, Antonio Sedeño-Noda, and 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.

MLA (9th ed.) Citation

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.