default search action
Amin Mostafaee
Person information
- affiliation: Azad University, Department of Mathematics, North-Tehran Branch, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j20]Maryam Shadab, Saber Saati
, Reza Farzipoor Saen
Measuring congestion in sustainable supply chain based on data envelopment analysis. Neural Comput. Appl. 33(19): 12477-12491 (2021) - [j19]Maryam Shadab, Saber Saati
Detecting congestion in DEA by solving one model. Oper. Res. Decis. 31(1) (2021) - 2020
- [j18]Amin Mostafaee, Milan Hladík
Optimal value bounds in interval fractional linear programming and revenue efficiency measuring. Central Eur. J. Oper. Res. 28(3): 963-981 (2020) - [j17]Amin Mostafaee, Majid Soleimani-Damaneh:
Global sub-increasing and global sub-decreasing returns to scale in free disposal hull technologies: Definition, characterization and calculation. Eur. J. Oper. Res. 280(1): 230-241 (2020) - [j16]Amin Mostafaee, Majid Soleimani-Damaneh
Closed form of the response function in FDH technologies: Theory, computation and application. RAIRO Oper. Res. 54(1): 53-68 (2020)
2010 – 2019
- 2019
- [j15]Amin Mostafaee, Sevan Sohraiee:
The role of hyperplanes for characterizing suspicious units in DEA. Ann. Oper. Res. 275(2): 531-549 (2019) - [j14]Amir Hassanzadeh, Amin Mostafaee:
Measuring the efficiency of network structures: Link control approach. Comput. Ind. Eng. 128: 437-446 (2019) - [j13]Ibrahim M. Tavakoli, Amin Mostafaee:
Free disposal hull efficiency scores of units with network structures. Eur. J. Oper. Res. 277(3): 1027-1036 (2019) - 2018
- [j12]Najmeh Malekmohammadi
Obtaining all extreme rays of a special cone using spanning trees in a complete digraph: Application in DEA. J. Oper. Res. Soc. 69(5): 762-771 (2018) - 2016
- [j11]Amin Mostafaee, Majid Soleimani-Damaneh
Some Conditions for Characterizing Anchor Points. Asia Pac. J. Oper. Res. 33(2): 1650013:1-1650013:17 (2016) - [j10]Amin Mostafaee, Milan Hladík
Inverse linear programming with interval coefficients. J. Comput. Appl. Math. 292: 591-608 (2016) - 2015
- [j9]Majid Soleimani-Damaneh
Identification of the anchor points in FDH models. Eur. J. Oper. Res. 246(3): 936-943 (2015) - 2014
- [j8]Amin Mostafaee, Majid Soleimani-Damaneh:
Identifying the anchor points in DEA using sensitivity analysis in linear programming. Eur. J. Oper. Res. 237(1): 383-388 (2014) - 2013
- [j7]Amin Mostafaee:
An equitable method for allocating fixed costs by using data envelopment analysis. J. Oper. Res. Soc. 64(3): 326-335 (2013) - 2010
- [j6]Amin Mostafaee, F. H. Saljooghi:
Cost efficiency measures in data envelopment analysis with data uncertainty. Eur. J. Oper. Res. 202(2): 595-603 (2010)
2000 – 2009
- 2009
- [j5]Majid Soleimani-Damaneh
Stability of the classification of returns to scale in FDH models. Eur. J. Oper. Res. 196(3): 1223-1228 (2009) - 2008
- [j4]Gholam Reza Jahanshahloo, Majid Soleimani-Damaneh
A simplified version of the DEA cost efficiency model. Eur. J. Oper. Res. 184(2): 814-815 (2008) - [j3]Majid Soleimani-Damaneh
A comment on "Returns to scale and scale elasticity in data envelopment analysis". Eur. J. Oper. Res. 184(3): 1179-1181 (2008) - 2007
- [j2]Gholam Reza Jahanshahloo, Majid Soleimani-Damaneh
On the computational complexity of cost efficiency analysis models. Appl. Math. Comput. 188(1): 638-640 (2007) - [j1]Gholam Reza Jahanshahloo, Majid Soleimani-Damaneh, Amin Mostafaee:
A mini-review of numerical methods for high-order problems. Int. J. Comput. Math. 84(4): 553-562 (2007)
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-25 05:40 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: