default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCan Akkan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Zeki Kus
, Can Akkan, Ayla Gülcü:
Novel Surrogate Measures Based on a Similarity Network for Neural Architecture Search. IEEE Access 11: 22596-22613 (2023)- 2022
- [j14]Can Akkan, Ayla Gülcü, Zeki Kus:
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation. J. Sched. 25(4): 477-501 (2022) - 2021
- [j13]Can Akkan, Ayla Gülcü, Zeki Kus:
Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions. Comput. Oper. Res. 132: 105306 (2021) - 2020
- [j12]Ayla Gülcü, Can Akkan:
Robust university course timetabling problem subject to single and multiple disruptions. Eur. J. Oper. Res. 283(2): 630-646 (2020) - [c1]Can Akkan, Ayla Gülcü, Zeki Kus:
Search Space Sampling by Simulated Annealing for Identifying Robust Solutions in Course Timetabling. CEC 2020: 1-10
2010 – 2019
- 2019
- [j11]Gülcin Ermis, Can Akkan:
Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure. Ann. Oper. Res. 275(1): 101-121 (2019) - 2018
- [j10]Can Akkan, Ayla Gülcü:
A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem. Comput. Oper. Res. 90: 22-32 (2018) - 2016
- [j9]Cenk Koças, Can Akkan:
A system for pricing the sales distribution from blockbusters to the long tail. Decis. Support Syst. 89: 56-65 (2016) - [j8]Can Akkan, M. Erdem Külünk, Cenk Koças:
Finding robust timetables for project presentations of student teams. Eur. J. Oper. Res. 249(2): 560-576 (2016) - [j7]Cenk Kocas, Can Akkan:
How Trending Status and Online Ratings Affect Prices of Homogeneous Products. Int. J. Electron. Commer. 20(3): 384-407 (2016) - 2015
- [j6]Can Akkan:
Improving schedule stability in single-machine rescheduling for new operation insertion. Comput. Oper. Res. 64: 198-209 (2015)
2000 – 2009
- 2006
- [j5]Selçuk Karabati, Can Akkan:
Minimizing sum of completion times on a single machine with sequence-dependent family setup times. J. Oper. Res. Soc. 57(3): 271-280 (2006) - 2005
- [j4]Can Akkan, Andreas Drexl, Alf Kimms:
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur. J. Oper. Res. 165(2): 339-358 (2005) - [j3]Can Akkan, Andreas Drexl, Alf Kimms:
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming. J. Log. Algebraic Methods Program. 62(1): 1-39 (2005) - 2004
- [j2]Can Akkan, Selçuk Karabati:
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. Eur. J. Oper. Res. 159(2): 420-429 (2004)
1990 – 1999
- 1997
- [j1]Can Akkan:
Finite-capacity scheduling-based planning for revenue-based capacity management. Eur. J. Oper. Res. 100(1): 170-179 (1997)
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-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
