Citazione Stile APA (7a Edizione)

Heimann, S., Hoang, H. P., & Hougardy, S. (2024). The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$.

Citazione stile Chigago Style (17a edizione)

Heimann, Sophia, Hung P. Hoang, e Stefan Hougardy. The $k$-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for $k \ge 5$. 2024.

Citatione MLA (9a ed.)

Heimann, Sophia, et al. The $k$-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for $k \ge 5$. 2024.