Publication:
Analyzing Shortest Path Problem via Single-Valued Triangular Neutrosophic Numbers: A Case Study

Simple item page
dc.authorscopusid57218311054
dc.authorscopusid57210121384
dc.authorscopusid57820510800
dc.authorscopusid57192215318
dc.contributor.authorKoca, G.
dc.contributor.authorDemir, E.
dc.contributor.authorİcan, O.
dc.contributor.authorKaramaşa, Ç.
dc.date.accessioned2025-12-11T00:27:47Z
dc.date.issued2021
dc.departmentOndokuz Mayıs Üniversitesien_US
dc.department-temp[Koca] Gozde, Faculty of Economics and Administrative Sciences, Bilecik Şeyh Edebali Üniversitesi, Bilecik, Turkey; [Demir] Ezgi, Faculty of Economics and Administrative Sciences, Pîrî Reis Üniversitesi, Istanbul, Turkey; [İcan] Özgür, Department of International Trade and Logistics, Ondokuz Mayis Üniversitesi, Samsun, Turkey; [Karamaşa] Çaǧlar, Department of Business Administration, Anadolu Üniversitesi, Eskisehir, Eskisehir, Turkeyen_US
dc.description.abstractThe shortest path problem as a core combinatorial problem in graph theory that can be applied in various fields such as project scheduling, routing, transportation, network, operation research, and computer science. The main objective of this problem is to find the path having minimum length between any pair of nodes (or vertices). In this study an algorithm was applied in order to find the shortest path having single-valued triangular neutrosophic numbers via score function. A real case study was introduced and solved by this algorithm for the purpose of showing the applicability in real-world problems. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.en_US
dc.identifier.doi10.1007/978-3-030-57197-9_25
dc.identifier.endpage573en_US
dc.identifier.isbn9783030571962
dc.identifier.isbn9783030571979
dc.identifier.scopus2-s2.0-85135512065
dc.identifier.startpage559en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-030-57197-9_25
dc.identifier.urihttps://hdl.handle.net/20.500.12712/36418
dc.language.isoenen_US
dc.publisherSpringer International Publishingen_US
dc.relation.publicationcategoryKitap Bölümü - Uluslararasıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectProject Managementen_US
dc.subjectScore Functionen_US
dc.subjectShortest Path Problemen_US
dc.subjectSingle-Valued Triangular Neutrosophic Numbersen_US
dc.titleAnalyzing Shortest Path Problem via Single-Valued Triangular Neutrosophic Numbers: A Case Studyen_US
dc.typeBook Parten_US
dspace.entity.typePublication

Files

Collections

Scopus İndeksli Yayınlar Koleksiyonu