default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustafa Kemal Tural
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Bilgenur Erdogan
, Mustafa Kemal Tural, Arsham Atashi Khoei:
Finding an energy efficient path for plug-in electric vehicles with speed optimization and travel time restrictions. Comput. Ind. Eng. 176: 108987 (2023)- [j11]Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural:
Energy minimizing order picker forklift routing problem. Eur. J. Oper. Res. 307(2): 604-626 (2023) - 2020
- [j10]Derya Dinler, Mustafa Kemal Tural, Nur Evin Özdemirel:
Centroid based Tree-Structured Data Clustering Using Vertex/Edge Overlap and Graph Edit Distance. Ann. Oper. Res. 289(1): 85-122 (2020) - [j9]Melda Kevser Akgün, Mustafa Kemal Tural:
k-step betweenness centrality. Comput. Math. Organ. Theory 26(1): 55-87 (2020) - [j8]Nazli Dolu, Umur Hastürk, Mustafa Kemal Tural:
Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances. Comput. Optim. Appl. 75(2): 537-560 (2020) - [j7]Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural:
Multi-facility green Weber problem. Comput. Oper. Res. 113 (2020) - [i3]Mustafa Kemal Tural:
On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound. CoRR abs/2001.01078 (2020)
2010 – 2019
- 2018
- [j6]Derya Dinler, Mustafa Kemal Tural:
Faster computation of successive bounds on the group betweenness centrality. Networks 71(4): 358-380 (2018) - 2017
- [j5]Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural:
Time-dependent green Weber problem. Comput. Oper. Res. 88: 316-323 (2017) - [j4]Derya Dinler, Mustafa Kemal Tural:
Robust semi-supervised clustering with polyhedral and circular uncertainty. Neurocomputing 265: 4-27 (2017) - 2016
- [j3]Derya Dinler, Mustafa Kemal Tural:
A minisum location problem with regional demand considering farthest Euclidean distances. Optim. Methods Softw. 31(3): 446-470 (2016) - [j2]Mustafa Kemal Tural:
Maximal matching polytope in trees. Optim. Methods Softw. 31(3): 471-478 (2016) - 2015
- [j1]Derya Dinler, Mustafa Kemal Tural, Cem Iyigun:
Heuristics for a continuous multi-facility location problem with demand regions. Comput. Oper. Res. 62: 237-256 (2015) - 2010
- [c1]Gábor Pataki, Mustafa Kemal Tural, Erick B. Wong:
Basis Reduction and the Complexity of Brand-and-Bound. SODA 2010: 1254-1261
2000 – 2009
- 2009
- [b1]Mustafa Kemal Tural:
Topics in basis reduction and integer programming. University of North Carolina, Chapel Hill, USA, 2009 - [i2]Gábor Pataki, Mustafa Kemal Tural:
Basis Reduction, and the Complexity of Branch-and-Bound. CoRR abs/0907.2639 (2009) - 2008
- [i1]Gábor Pataki, Mustafa Kemal Tural:
Branching proofs of infeasibility in low density subset sum problems. CoRR abs/0808.0023 (2008)
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-04-26 18:25 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:
