Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/1182
Title: Multiobjective traveling salesperson problem on Halin graphs
Authors: Özpeynirci, Özgür
Koksalan, Murat
Keywords: Traveling salesperson problem
Bottleneck traveling salesperson problem
Multiple objectives
Solvable cases
Halin graphs
Computational complexity
Salesman Problem
Publisher: Elsevier
Abstract: 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 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.
URI: https://doi.org/10.1016/j.ejor.2008.04.011
https://hdl.handle.net/20.500.14365/1182
ISSN: 0377-2217
1872-6860
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
202.pdf
  Restricted Access		310.07 kBAdobe PDFView/Open    Request a copy
Show full item record



CORE Recommender

SCOPUSTM   
Citations

9
checked on Nov 6, 2024

WEB OF SCIENCETM
Citations

7
checked on Nov 6, 2024

Page view(s)

122
checked on Nov 11, 2024

Download(s)

6
checked on Nov 11, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.