Suivre
Seyed Mehdi Mansourzadeh
Seyed Mehdi Mansourzadeh
University of Mazandaran
Adresse e-mail validée de khayam.ut.ac.ir
Titre
Citée par
Citée par
Année
Target setting in the general combined-oriented CCR model using an interactive MOLP method
FH Lotfi, GR Jahanshahloo, A Ebrahimnejad, M Soltanifar, ...
Journal of Computational and Applied Mathematics 234 (1), 1-9, 2010
852010
Relationship between MOLP and DEA based on output-orientated CCR dual model
FH Lotfi, GR Jahanshahloo, M Soltanifar, A Ebrahimnejad, ...
expert Systems with Applications 37 (6), 4331-4336, 2010
842010
Bounded primal simplex algorithm for bounded linear programming with fuzzy cost coefficients
A Ebrahimnejad, SH Nasseri, SM Mansourzadeh
International Journal of Operations Research and Information Systems (IJORIS …, 2011
562011
A hybrid DEA-MOLP model for public school assessment and closure decision in the City of Philadelphia
M Tavana, A Ebrahimnejad, FJ Santos-Arteaga, SM Mansourzadeh, ...
Socio-Economic Planning Sciences 61, 70-89, 2018
522018
Modified bounded dual network simplex algorithm for solving minimum cost flow problem with fuzzy costs based on ranking functions
A Ebrahimnejad, SH Nasseri, SM Mansourzadeh
Journal of Intelligent and Fuzzy Systems, 2013
162013
An interactive MOLP method for solving output-oriented DEA problems with undesirable factors
A Ebrahimnejad, M Tavana, SM Mansourzadeh
Journal of Industrial & Management Optimization 11 (4), 1089-1110, 2015
152015
A comparative study of different approaches for finding the upper boundary points in stochastic-flow networks
SM Mansourzadeh, SH Nasseri, M Forghani-elahabad, A Ebrahimnejad
International Journal of Enterprise Information Systems (IJEIS) 10 (3), 13-23, 2014
112014
On efficiency in convex hull of DMUs
M Soltanifar, GR Jahanshahloo, FH Lotfi, SM Mansourzadeh
Applied mathematical modelling 37 (4), 2267-2278, 2013
112013
International Journal of Enterprise Information Systems
SM Mansourzadeh, SH Nasseri, M Forghani-elahabad, AZ Ravasan, ...
2014
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–9