default search action
Korhan Karabulut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Korhan Karabulut, Damla Kizilay, Mehmet Fatih Tasgetiren, Liang Gao, Levent Kandiller:
An evolution strategy approach for the distributed blocking flowshop scheduling problem. Comput. Ind. Eng. 163: 107832 (2022) - [j8]Korhan Karabulut, Hande Öztop, Damla Kizilay, Mehmet Fatih Tasgetiren, Levent Kandiller:
An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 142: 105733 (2022) - [j7]Kazim Erdogdu, Korhan Karabulut:
Bi-objective green vehicle routing problem. Int. Trans. Oper. Res. 29(3): 1602-1626 (2022) - 2021
- [j6]Korhan Karabulut, Hande Öztop, Levent Kandiller, Mehmet Fatih Tasgetiren:
Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach. Comput. Oper. Res. 129: 105192 (2021) - [j5]Kazim Erdogdu, Korhan Karabulut:
A new model for minimizing the electric vehicle battery capacity in electric travelling salesman problem with time windows. Turkish J. Electr. Eng. Comput. Sci. 29(5): 2545-2560 (2021) - [c8]Ekincan Ufuktepe, Deniz Kavzak Ufuktepe, Korhan Karabulut:
MuKEA-TCP: A Mutant Kill-based Local Search Augmented Evolutionary Algorithm Approach for Test Case Prioritization. COMPSAC 2021: 962-967 - 2020
- [j4]Korhan Karabulut, Mehmet Fatih Tasgetiren:
An evolution strategy approach to the team orienteering problem with time windows. Comput. Ind. Eng. 139: 106109 (2020) - [j3]Gökçer Peynirci, Mete Eminagaoglu, Korhan Karabulut:
Feature Selection for Malware Detection on the Android Platform Based on Differences of IDF Values. J. Comput. Sci. Technol. 35(4): 946-962 (2020)
2010 – 2019
- 2019
- [c7]Alper Kizil, Korhan Karabulut:
Effects of Parameters of an Island Model Parallel Genetic Algorithm for the Quadratic Assignment Problem. IIAI-AAI 2019: 444-449 - 2016
- [j2]Korhan Karabulut:
A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Comput. Ind. Eng. 98: 300-307 (2016) - [c6]Yavuz Ince, Korhan Karabulut, Mehmet Fatih Tasgetiren, Quan-Ke Pan:
A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times. CEC 2016: 3401-3408 - 2014
- [j1]Korhan Karabulut, Mehmet Fatih Tasgetiren:
A variable iterated greedy algorithm for the traveling salesman problem with time windows. Inf. Sci. 279: 383-395 (2014) - 2013
- [c5]Korhan Karabulut, Mehmet Fatih Tasgetiren:
A discrete artificial bee colony algorithm for the team orienteering problem with time windows. CIPLS 2013: 99-106 - [c4]Mustafa Seçmen, Mehmet Fatih Tasgetiren, Korhan Karabulut:
Null control in linear antenna arrays with ensemble differential evolution. SDE 2013: 92-98 - [c3]Mehmet Fatih Tasgetiren, Ozge Buyukdagli, Damla Kizilay, Korhan Karabulut:
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem. SEMCCO (1) 2013: 1-12 - 2012
- [c2]Korhan Karabulut, Mehmet Fatih Tasgetiren:
A discrete artificial bee colony algorithm for the traveling salesman problem with time windows. IEEE Congress on Evolutionary Computation 2012: 1-7
2000 – 2009
- 2004
- [b1]Korhan Karabulut:
Kalıtsal algoritmalarla optimizasyon (Optimization using genetic algorithms). Ege University, Turkey, 2004 - [c1]Korhan Karabulut, Mustafa Murat Inceoglu:
A Hybrid Genetic Algorithm for Packing in 3D with Deepest Bottom Left with Fill Method. ADVIS 2004: 441-450
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint