Özpeynirci, ÖzgürKoksalan, Murat2023-06-162023-06-1620090377-22171872-6860https://doi.org/10.1016/j.ejor.2008.04.011https://hdl.handle.net/20.500.14365/1182In 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 problems. We show computational complexities of finding a single nondominated point as well as finding all nondominated points for different objective function combinations. We develop algorithms for the polynomially solvable combinations. (C) 2008 Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/closedAccessTraveling salesperson problemBottleneck traveling salesperson problemMultiple objectivesSolvable casesHalin graphsComputational complexitySalesman ProblemArticle10.1016/j.ejor.2008.04.0112-s2.0-56549106233