APA (7th ed.) Citation

Ascheuer, N., Jünger, M., & Reinelt, G. (2000). A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Computational optimization and applications, 17(1), . https://doi.org/10.1023/A:1008779125567

Chicago Style (17th ed.) Citation

Ascheuer, Norbert, Michael Jünger, and Gerhard Reinelt. "A Branch and Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints." Computational Optimization and Applications 17, no. 1 (2000). https://doi.org/10.1023/A:1008779125567.

MLA (9th ed.) Citation

Ascheuer, Norbert, et al. "A Branch and Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints." Computational Optimization and Applications, vol. 17, no. 1, 2000, https://doi.org/10.1023/A:1008779125567.