default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTugba Saraç
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Ilknur Tükenmez
, Tugba Saraç, Onur Kaya:
A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles. J. Heuristics 30(5): 359-396 (2024)- [j10]Ilknur Tükenmez, Tugba Saraç, Onur Kaya:
Correction to: A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles. J. Heuristics 30(5): 397 (2024) - 2023
- [j9]Busra Tutumlu, Tugba Saraç:
A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting. Comput. Oper. Res. 155: 106222 (2023) - [j8]Tugba Saraç, Feristah Ozcelik, Mehmet Ertem:
Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times. Oper. Res. 23(3): 46 (2023)
2010 – 2019
- 2019
- [j7]Gulcin Bektur, Tugba Saraç:
A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Comput. Oper. Res. 103: 46-63 (2019) - [j6]Mehmet Ertem, Feristah Ozcelik, Tugba Saraç:
Single machine scheduling problem with stochastic sequence-dependent setup times. Int. J. Prod. Res. 57(10): 3273-3289 (2019) - 2014
- [j5]Tugba Saraç, Aydin Sipahioglu:
Generalized quadratic multiple knapsack problem and two solution approaches. Comput. Oper. Res. 43: 78-89 (2014) - [c4]Tugba Saraç:
Rafta Hazır Ticari Yazılımların Hava Aracı Tip Sertifikası Alım Sürecinde Alternatif Uyum Gösterim Yöntemleri. UYMS 2014 - 2013
- [c3]Tugba Saraç:
Hürkuş Projesi'nin Yazılım Kapsamında Sertifikasyon Yolculuğu. UYMS 2013 - 2012
- [j4]Tugba Saraç, Feristah Ozcelik:
A genetic algorithm with proper parameters for manufacturing cell formation problems. J. Intell. Manuf. 23(4): 1047-1061 (2012) - 2011
- [j3]Nergiz Kasimbeyli, Tugba Saraç, Refail Kasimbeyli:
A two-objective mathematical model without cutting patterns for one-dimensional assortment problems. J. Comput. Appl. Math. 235(16): 4663-4674 (2011)
2000 – 2009
- 2009
- [j2]Aydin Sipahioglu, Tugba Saraç:
The Performance of the Modified Subgradient Algorithm on Solving the 0-1 Quadratic Knapsack Problem. Informatica 20(2): 293-304 (2009) - 2007
- [j1]Rafail N. Gasimov, Aydin Sipahioglu, Tugba Saraç:
A multi-objective programming approach to 1.5-dimensional assortment problem. Eur. J. Oper. Res. 179(1): 64-79 (2007) - [c2]Tugba Saraç, Aydin Sipahioglu:
A Genetic Algorithm for the Quadratic Multiple Knapsack Problem. BVAI 2007: 490-498 - 2003
- [c1]Tugba Saraç, Müjgan Sagir Özdemir:
A Genetic Algorithm for 1, 5 Dimensional Assortment Problems with Multiple Objectives. IEA/AIE 2003: 41-51
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-11-07 21:36 CET 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:
