default search action
Ali Asghar Foroughi
Person information
- affiliation: Department of Mathematics, University of Qom, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Maryam Masoumi Hazhir, Ali Asghar Foroughi:
A compromise programming approach for cross efficiency measurement in basic two-stage network system. Expert Syst. Appl. 252: 124205 (2024) - 2022
- [j16]Ali Asghar Foroughi
, Hooshyar Azad
A new AHP-prioritization method based on linear programming for crisp and interval preference relations. Int. Trans. Oper. Res. 29(6): 3778-3797 (2022)
2010 – 2019
- 2019
- [j15]Ali Asghar Foroughi
Discriminating extreme efficient decision making units in DEA using random weight vectors. Comput. Ind. Eng. 128: 305-312 (2019) - [j14]Mostafa Naghavi
Inverse optimization for multi-objective linear programming. Optim. Lett. 13(2): 281-294 (2019) - 2018
- [j13]M. J. Rezaeiani, A. A. Foroughi
Ranking efficient decision making units in data envelopment analysis based on reference frontier share. Eur. J. Oper. Res. 264(2): 665-674 (2018) - 2017
- [j12]Ali Asghar Foroughi
Solving generalized fuzzy data envelopment analysis model: a parametric approach. Central Eur. J. Oper. Res. 25(4): 889-905 (2017) - [j11]Chuanyin Guo
Decomposition weights and overall efficiency in two-stage additive network DEA. Eur. J. Oper. Res. 257(3): 896-906 (2017) - 2012
- [j10]Ali Asghar Foroughi
New approaches for determining a common set of weights for a voting system. Int. Trans. Oper. Res. 19(4): 521-530 (2012) - [j9]Ali Asghar Foroughi
Ranking units in DEA based on efficiency intervals and decision-maker's preferences. Int. Trans. Oper. Res. 19(4): 567-579 (2012) - 2011
- [j8]A. A. Foroughi
A new mixed integer linear model for selecting the best decision making units in data envelopment analysis. Comput. Ind. Eng. 60(4): 550-554 (2011) - [j7]A. A. Foroughi
A note on "A new method for ranking discovered rules from data mining by DEA", and a full ranking approach. Expert Syst. Appl. 38(10): 12913-12916 (2011)
2000 – 2009
- 2006
- [j6]Majid Soleimani-Damaneh, Gholam Reza Jahanshahloo, Ali Asghar Foroughi
A comment on "Measuring super-efficiency in DEA in the presence of infeasibility". Eur. J. Oper. Res. 170(1): 323-325 (2006) - [j5]Abdollah Hadi-Vencheh
A generalized DEA model for inputs/outputs estimation. Math. Comput. Model. 43(5-6): 447-457 (2006) - 2005
- [j4]Gholam Reza Jahanshahloo, Ali Asghar Foroughi
Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons. Appl. Math. Comput. 162(2): 991-1005 (2005) - [j3]Ali Asghar Foroughi
A selection method for a preferential election. Appl. Math. Comput. 163(1): 107-116 (2005) - 2004
- [j2]Gholam Reza Jahanshahloo, Ali Asghar Foroughi
Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems. Appl. Math. Comput. 150(1): 203-211 (2004) - [j1]Gholam Reza Jahanshahloo, A. Hadi-Vencheh
Inputs/outputs estimation in DEA when some factors are undesirable. Appl. Math. Comput. 156(1): 19-32 (2004)
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-08-04 19:10 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: