default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDH. Hasan Örkcü
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Volkan Soner Özsoy
, Mediha Örkcü, H. Hasan Örkcü:
A minimax approach for selecting the overall and stage-level most efficient unit in two stage production processes. Ann. Oper. Res. 300(1): 137-169 (2021)- [j14]Volkan Soner Özsoy, H. Hasan Örkcü, Mediha Örkcü:
A simplistic approach without epsilon to choose the most efficient unit in data envelopment analysis. Expert Syst. Appl. 168: 114472 (2021) - 2020
- [j13]Volkan Soner Özsoy, Mehmet Güray Ünsal, H. Hasan Örkcü:
Use of the heuristic optimization in the parameter estimation of generalized gamma distribution: comparison of GA, DE, PSO and SA methods. Comput. Stat. 35(4): 1895-1925 (2020) - [j12]Mediha Örkcü, Volkan Soner Özsoy, H. Hasan Örkcü:
An optimistic-pessimistic DEA model based on game cross efficiency approach. RAIRO Oper. Res. 54(4): 1215-1230 (2020)
2010 – 2019
- 2019
- [j11]H. Hasan Örkcü, Volkan Soner Özsoy, Mediha Örkcü, Hasan Bal:
A neutral cross efficiency approach for basic two stage production systems. Expert Syst. Appl. 125: 333-344 (2019) - 2015
- [j10]H. Hasan Örkcü, Ertugrul Aksoy, Mustafa Isa Dogan:
Estimating the parameters of 3-p Weibull distribution through differential evolution. Appl. Math. Comput. 251: 211-224 (2015) - [j9]H. Hasan Örkcü, Volkan Soner Özsoy, Ertugrul Aksoy, Mustafa Isa Dogan:
Estimating the parameters of 3-p Weibull distribution using particle swarm optimization: A comprehensive experimental comparison. Appl. Math. Comput. 268: 201-226 (2015) - [j8]H. Hasan Örkcü, Mehmet Güray Ünsal, Hasan Bal:
A modification of a mixed integer linear programming (MILP) model to avoid the computational complexity. Ann. Oper. Res. 235(1): 599-623 (2015) - 2013
- [j7]H. Hasan Örkcü:
Subset selection in multiple linear regression models: A hybrid of genetic and simulated annealing algorithms. Appl. Math. Comput. 219(23): 11018-11028 (2013) - 2011
- [j6]H. Hasan Örkcü, Hasan Bal:
Goal programming approaches for data envelopment analysis cross efficiency evaluation. Appl. Math. Comput. 218(2): 346-356 (2011) - [j5]Hasan Bal, H. Hasan Örkcü:
A new mathematical programming approach to multi-group classification problems. Comput. Oper. Res. 38(1): 105-111 (2011) - [j4]H. Hasan Örkcü, Hasan Bal:
Comparing performances of backpropagation and genetic algorithms in the data classification. Expert Syst. Appl. 38(4): 3703-3709 (2011) - 2010
- [j3]Hasan Bal, H. Hasan Örkcü, Salih Çelebioglu:
Improving the discrimination power and weights dispersion in the data envelopment analysis. Comput. Oper. Res. 37(1): 99-107 (2010)
2000 – 2009
- 2008
- [j2]Hasan Bal, H. Hasan Örkcü, Salih Çelebioglu:
A new method based on the dispersion of weights in data envelopment analysis. Comput. Ind. Eng. 54(3): 502-512 (2008) - 2006
- [j1]Hasan Bal, H. Hasan Örkcü, Salih Çelebioglu:
An experimental comparison of the new goal programming and the linear programming approaches in the two-group discriminant problems. Comput. Ind. Eng. 50(3): 296-311 (2006)
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-24 23:11 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:
