Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Relative distances approach for multi-traveling salesmen problem
Date
2024-09-01
Author
Ergüven, Emre
Polat, Faruk
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
56
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/110193
Journal
KNOWLEDGE-BASED SYSTEMS
DOI
https://doi.org/10.1016/j.knosys.2024.112160
Collections
Department of Computer Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Ergüven and F. Polat, “Relative distances approach for multi-traveling salesmen problem,”
KNOWLEDGE-BASED SYSTEMS
, vol. 300, no. 112160, pp. 1–14, 2024, Accessed: 00, 2024. [Online]. Available: https://hdl.handle.net/11511/110193.
