Ahr, D., & Reinelt, G. (2006). A tabu search algorithm for the min-max k-chinese postman problem. Computers & operations research, 33(12), .
Chicago Style (17th ed.) CitationAhr, Dino, and Gerhard Reinelt. "A Tabu Search Algorithm for the Min-max K-chinese Postman Problem." Computers & Operations Research 33, no. 12 (2006).
MLA (9th ed.) CitationAhr, Dino, and Gerhard Reinelt. "A Tabu Search Algorithm for the Min-max K-chinese Postman Problem." Computers & Operations Research, vol. 33, no. 12, 2006.
Warning: These citations may not always be 100% accurate.