APA (7th ed.) Citation

Schneider, J., Froschhammer, C., Morgenstern, I., Husslein, T., & Singer, J. M. (1996). Searching for backbones — an efficient parallel algorithm for the traveling salesman problem. Computer physics communications, 96(2), 173-188. https://doi.org/10.1016/0010-4655(96)00062-8

Chicago Style (17th ed.) Citation

Schneider, Johannes, Christine Froschhammer, Ingo Morgenstern, Thomas Husslein, and Johannes Maria Singer. "Searching for Backbones — an Efficient Parallel Algorithm for the Traveling Salesman Problem." Computer Physics Communications 96, no. 2 (1996): 173-188. https://doi.org/10.1016/0010-4655(96)00062-8.

MLA (9th ed.) Citation

Schneider, Johannes, et al. "Searching for Backbones — an Efficient Parallel Algorithm for the Traveling Salesman Problem." Computer Physics Communications, vol. 96, no. 2, 1996, pp. 173-188, https://doi.org/10.1016/0010-4655(96)00062-8.