default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkram Dehnokhalaji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Maria Michali
, Ali Emrouznejad, Akram Dehnokhalaji, Ben Clegg:
Subsampling bootstrap in network DEA. Eur. J. Oper. Res. 305(2): 766-780 (2023)- 2022
- [j15]Nasim Nasrabadi, Akram Dehnokhalaji, Pekka Korhonen, Banu Lokman, Jyrki Wallenius:
Robustness of efficiency scores in data envelopment analysis with interval scale data. Eur. J. Oper. Res. 297(3): 1151-1161 (2022) - [j14]Akram Dehnokhalaji, Somayeh Khezri, Ali Emrouznejad:
A box-uncertainty in DEA: A robust performance measurement framework. Expert Syst. Appl. 187: 115855 (2022) - 2021
- [j13]Somayeh Khezri, Akram Dehnokhalaji, Farhad Hosseinzadeh Lotfi:
A full investigation of the directional congestion in data envelopment analysis. RAIRO Oper. Res. 55(Supplement): S571-S591 (2021) - 2020
- [j12]Sebastián Lozano, Narges Soltani, Akram Dehnokhalaji:
A compromise programming approach for target setting in DEA. Ann. Oper. Res. 288(1): 363-390 (2020)
2010 – 2019
- 2019
- [j11]Jafar Sadeghi, Akram Dehnokhalaji:
A comprehensive method for the centralized resource allocation in DEA. Comput. Ind. Eng. 127: 344-352 (2019) - [j10]Nasim Nasrabadi, Akram Dehnokhalaji, Pekka Korhonen, Jyrki Wallenius:
A stepwise benchmarking approach to DEA with interval scale data. J. Oper. Res. Soc. 70(6): 954-961 (2019) - [j9]Akram Dehnokhalaji, Narges Soltani:
Gradual efficiency improvement through a sequence of targets. J. Oper. Res. Soc. 70(12): 2143-2152 (2019) - 2018
- [j8]Pekka J. Korhonen, Akram Dehnokhalaji, Nasim Nasrabadi:
A lexicographic radial projection onto the efficient frontier in Data Envelopment Analysis. Eur. J. Oper. Res. 265(3): 1005-1012 (2018) - [j7]Tommi Pajala, Pekka Korhonen, Pekka Malo, Ankur Sinha, Jyrki Wallenius, Akram Dehnokhalaji:
Accounting for political opinions, power, and influence: A Voting Advice Application. Eur. J. Oper. Res. 266(2): 702-715 (2018) - 2017
- [j6]Akram Dehnokhalaji, Mojtaba Ghiyasi, Pekka Korhonen:
Resource allocation based on cost efficiency. J. Oper. Res. Soc. 68(10): 1279-1289 (2017) - [j5]Akram Dehnokhalaji, Behjat Hallaji, Narges Soltani, Jafar Sadeghi:
Convex cone-based ranking of decision-making units in DEA. OR Spectr. 39(3): 861-880 (2017) - 2014
- [j4]Nasim Nasrabadi, Akram Dehnokhalaji, Majid Soleimani-Damaneh:
Characterizing a subset of the PPS maintaining the reference hyperplane of the radial projection point. J. Oper. Res. Soc. 65(12): 1876-1885 (2014) - 2012
- [j3]Nasim Nasrabadi, Akram Dehnokhalaji, Narsis Aftab Kiani, Pekka J. Korhonen, Jyrki Wallenius:
Resource allocation for performance improvement. Ann. Oper. Res. 196(1): 459-468 (2012) - 2011
- [j2]Akram Dehnokhalaji, Pekka J. Korhonen, Murat Köksalan, Nasim Nasrabadi, Jyrki Wallenius:
Convex cone-based partial order for multiple criteria alternatives. Decis. Support Syst. 51(2): 256-261 (2011) - 2010
- [j1]Akram Dehnokhalaji, Pekka J. Korhonen, Murat Köksalan, Nasim Nasrabadi, Jyrki Wallenius:
Efficiency analysis to incorporate interval-scale data. Eur. J. Oper. Res. 207(2): 1116-1121 (2010)
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-10-07 22:23 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:
