default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDH. Mishmast Nehi
Person information
- affiliation: University of Sistan and Baluchestan, Mathematics Faculty, Zahedan, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Sima Sargazi
, Hamed Ahmadzade, Hassan Mishmast Nehi, Jafar Sayareh:
A Simulated Annealing Algorithm for Quay Crane Scheduling and Assignment Problem Under Uncertain Conditions. J. Uncertain Syst. 17(1): 2350010:1-2350010:29 (2024)- [j17]Samira Samanifar, Hamed Ahmadzade, Hassan Mishmast Nehi:
Windy Postman Problem Under Uncertainty. J. Uncertain Syst. 17(1): 2350014:1-2350014:19 (2024) - [j16]Samira Samanifar, Hamed Ahmadzade, Hassan Mishmast Nehi:
Uncertain Maximum Benefit about Chinese Postman Problem. J. Uncertain Syst. 17(3): 2450009:1-2450009:24 (2024) - 2022
- [j15]Seyyedeh Zohreh Aftabi, Abbas Ali Ahangar, Hassan Mishmast Nehi:
Derivational Suffix Productivity in Persian: A Fuzzy Analysis. J. Quant. Linguistics 29(3): 387-411 (2022) - 2021
- [j14]Abazar Keikha, Harish Garg, Hassan Mishmast Nehi:
An approach based on combining Choquet integral and TOPSIS methods to uncertain MAGDM problems. Soft Comput. 25(10): 7181-7195 (2021) - 2020
- [j13]Fatemeh Salary Pour Sharif Abad, Mehdi Allahdadi, Hasan Mishmast Nehi:
Interval linear fractional programming: optimal value range of the objective function. Comput. Appl. Math. 39(4) (2020) - [j12]H. Mishmast Nehi, Hasan Ali Ashayerinasab, Mehdi Allahdadi:
Solving methods for interval linear programming problem: a review and an improved method. Oper. Res. 20(3): 1205-1229 (2020)
2010 – 2019
- 2019
- [j11]Moslem Javanmard, Hassan Mishmast Nehi:
A Solving Method for Fuzzy Linear Programming Problem with Interval Type-2 Fuzzy Numbers. Int. J. Fuzzy Syst. 21(3): 882-891 (2019) - 2018
- [j10]Hasan Ali Ashayerinasab, Hasan Mishmast Nehi, Mehdi Allahdadi:
Solving the interval linear programming problem: A new algorithm for a general case. Expert Syst. Appl. 93: 39-49 (2018) - 2016
- [j9]Mehdi Allahdadi, Hasan Mishmast Nehi, Hasan Ali Ashayerinasab, Moslem Javanmard:
Improving the modified interval linear programming method by new techniques. Inf. Sci. 339: 224-236 (2016) - [j8]Hassan Mishmast Nehi, Abazar Keikha:
TOPSIS and Choquet integral hybrid technique for solving MAGDM problems with interval type-2 fuzzy numbers. J. Intell. Fuzzy Syst. 30(3): 1301-1310 (2016) - [j7]Hamed Farahani, Hassan Mishmast Nehi, Mahmoud Paripour:
Solving fuzzy complex system of linear equations using eigenvalue method. J. Intell. Fuzzy Syst. 31(3): 1689-1699 (2016) - 2015
- [j6]Abazar Keikha, H. Mishmast Nehi:
Fuzzified Choquet Integral and its Applications in MADM: A Review and A New Method. Int. J. Fuzzy Syst. 17(2): 337-352 (2015) - 2014
- [j5]Ehsan Adili, Mohamad Reza Sohrabi, Hassan Mishmast Nehi:
Prediction of microcracks in concrete using fuzzy systems. J. Intell. Fuzzy Syst. 27(3): 1161-1168 (2014) - 2013
- [j4]Mehdi Allahdadi, Hasan Mishmast Nehi:
The optimal solution set of the interval linear programming problems. Optim. Lett. 7(8): 1893-1911 (2013) - 2012
- [j3]Hasan Mishmast Nehi, Farhad Hamidi:
A comment on "Biological computation of the solution to the quadratic assignment problem". Appl. Math. Comput. 218(21): 10759-10761 (2012)
2000 – 2009
- 2007
- [j2]Majid Darehmiraki, Hasan Mishmast Nehi:
Molecular solution to the 0-1 knapsack problem based on DNA computing. Appl. Math. Comput. 187(2): 1033-1037 (2007) - [j1]Majid Darehmiraki, Hasan Mishmast Nehi:
A surface-based DNA algorithm for the solving binary knapsack problem. Appl. Math. Comput. 188(2): 1991-1994 (2007) - 2002
- [c1]Hamid Reza Maleki, Hassan Mishmast Nehi, Mashaallah Mashinchi:
Fuzzy Number Linear Programming: A Probabilistic Approach. AFSS 2002: 491-496
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-04 21:00 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:
