default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuseyin Tunc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j10]Emel Kurul, Huseyin Tunc
, Murat Sari, Nuran Guzel:
Deep learning aided surrogate modeling of the epidemiological models. J. Comput. Sci. 84: 102470 (2025)- 2024
- [j9]Huseyin Tunc, Sumeyye Yilmaz, Busra Nur Darendeli Kiraz, Murat Sari, Seyfullah Enes Kotil, Özge Sensoy, Serdar Durdagi:
Improving Predictive Efficacy for Drug Resistance in Novel HIV-1 Protease Inhibitors through Transfer Learning Mechanisms. J. Chem. Inf. Model. 64(20): 7844-7863 (2024) - 2021
- [j8]Huseyin Tunc:
A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times. Comput. Oper. Res. 132: 105302 (2021) - [j7]Huseyin Tunc, Burkay Genç:
A column generation based heuristic algorithm for piecewise linear regression. Expert Syst. Appl. 171: 114539 (2021) - 2019
- [j6]Onur A. Kilic, Huseyin Tunc:
Heuristics for the stochastic economic lot sizing problem with remanufacturing under backordering costs. Eur. J. Oper. Res. 276(3): 880-892 (2019) - [j5]Sudipta Chowdhury, Mohammad Marufuzzaman, Huseyin Tunc, Linkan Bian, William Bullington:
A modified Ant Colony Optimization algorithm to solve a dynamic traveling salesman problem: A case study with drones for wildlife surveillance. J. Comput. Des. Eng. 6(3): 368-386 (2019) - 2018
- [j4]Onur A. Kilic, Huseyin Tunc, S. Armagan Tarim:
Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints. Eur. J. Oper. Res. 267(3): 1102-1109 (2018) - [j3]Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Roberto Rossi:
An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem. INFORMS J. Comput. 30(3): 492-506 (2018) - 2016
- [j2]Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Burak Eksioglu:
The stochastic lot sizing problem with piecewise linear concave ordering costs. Comput. Oper. Res. 65: 104-110 (2016) - 2014
- [j1]Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Burak Eksioglu:
A reformulation for the stochastic lot sizing problem with service-level constraints. Oper. Res. Lett. 42(2): 161-165 (2014)
Conference and Workshop Papers
- 2013
- [c1]Huseyin Tunc, Burak Eksioglu:
A Reformulation for Static-Dynamic Uncertainty Strategy under Service Level Constraint. MIM 2013: 2009-2014
Informal and Other Publications
- 2021
- [i3]Huseyin Tunc, Murat Sari:
A New Implicit-Explicit Local Method to Capture Stiff Behavior with COVID-19 Outbreak Application. CoRR abs/2104.05817 (2021) - [i2]Huseyin Tunc, Murat Sari:
A spatial local method for solving 2D and 3D advection-diffusion equations. CoRR abs/2104.06455 (2021) - [i1]Huseyin Tunc, Murat Sari:
A stability preserved time-integration method for nonlinear advection-diffusion models. CoRR abs/2104.12554 (2021)
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 2025-01-09 20:39 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:
