Yayınlar & Eserler

Yayın Ağı
Makaleler 2
Tümü (2)
Scopus (2)

1. Scalable parallel memetic algorithms for large close-enough traveling salesman problems

Cantürk D., Dökeroğlu T.
Neural Computing and Applications , cilt.38, sa.2, 2026 (Scopus) Creative Commons License identifier

2. New Harris Hawks algorithms for the Close-Enough Traveling Salesman Problem

Dökeroğlu T., Cantürk D.
Intelligent Systems with Applications , cilt.28, 2025 (Scopus) identifier
Hakemli Bilimsel Toplantılarda Yayımlanmış Bildiriler 1

1. A New Parallel Fitness-Oriented Memetic Algorithm for the Close Enough Traveling Salesman Problem Yeterince Yakin Gezgin Satici Problemi i in Paralel Fitness Y nelimli Memetic Algoritma nerisi

Cantürk D.
33rd IEEE Conference on Signal Processing and Communications Applications, SIU 2025, İstanbul, Türkiye, 25 - 28 Haziran 2025, (Tam Metin Bildiri) identifier
Metrikler

Yayın

3

Yayın (Scopus)

3

Açık Erişim

1