Özpeynirci, Özgür; Köksalan, Murat - In: European Journal of Operational Research 196 (2009) 1, pp. 155-161
In this paper, we study traveling salesperson (TSP) and bottleneck traveling salesperson (BTSP) problems on special graphs called Halin graphs. Although both problems are NP-Hard on general graphs, they are polynomially solvable on Halin graphs. We address the multiobjective versions of these...