default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHashem Mahlooji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j15]Ali Ghazizadeh, Hashem Mahlooji, Ahmad Taher Azar, Mahdi Hamid, Mahdi Bastan:
Single-step change point estimation in nonlinear profiles using maximum likelihood estimation. Int. J. Intell. Eng. Informatics 6(6): 527-547 (2018)- 2017
- [j14]Alireza Shadman, Changliang Zou, Hashem Mahlooji, Arthur B. Yeh:
A change point method for Phase II monitoring of generalized linear profiles. Commun. Stat. Simul. Comput. 46(1): 559-578 (2017) - [j13]Samira Moghaddam, Hashem Mahlooji:
A new metamodel-based method for solving semi-expensive simulation optimization problems. Commun. Stat. Simul. Comput. 46(6): 4795-4811 (2017) - 2015
- [j12]Alireza Shadman
, Hashem Mahlooji, Arthur B. Yeh, Changliang Zou:
A Change Point Method for Monitoring Generalized Linear Profiles in Phase I. Qual. Reliab. Eng. Int. 31(8): 1367-1381 (2015) - 2014
- [j11]Ali Ajdari, Hashem Mahlooji:
An Adaptive Exploration-Exploitation Algorithm for Constructing Metamodels in Random Simulation Using a Novel Sequential Experimental Design. Commun. Stat. Simul. Comput. 43(5): 947-968 (2014) - [j10]Ali Mohammad Nezhad, Hashem Mahlooji:
An artificial neural network meta-model for constrained simulation optimization. J. Oper. Res. Soc. 65(8): 1232-1244 (2014) - 2013
- [j9]Hashem Vahdani, Hashem Mahlooji, Abdolhamid Eshraghniaye Jahromi:
Warranty servicing for discretely degrading items with non-zero repair time under renewing warranty. Comput. Ind. Eng. 65(1): 176-185 (2013) - [j8]Amin Khoshkenar, Hashem Mahlooji:
A New Test of Randomness for Lehmer Generators Based on the Manhattan Distance Between Pairs of Consecutive Random Numbers. Commun. Stat. Simul. Comput. 42(1): 202-214 (2013) - 2012
- [j7]Hassan Shavandi, Hashem Mahlooji, Nasim Ekram Nosratian:
A constrained multi-product pricing and inventory control problem. Appl. Soft Comput. 12(8): 2454-2461 (2012) - [j6]Babak Abbasi, Hashem Mahlooji:
Improving response surface methodology by using artificial neural network and simulated annealing. Expert Syst. Appl. 39(3): 3461-3468 (2012) - 2011
- [j5]Hashem Vahdani, Stefanka S. Chukova, Hashem Mahlooji:
On optimal replacement-repair policy for multi-state deteriorating products under renewing free replacement warranty. Comput. Math. Appl. 61(4): 840-850 (2011) - [j4]Ali Mohammad Nezhad, Hashem Mahlooji:
A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems. Comput. Oper. Res. 38(8): 1164-1174 (2011) - [j3]A. Moeini, Babak Abbasi, Hashem Mahlooji:
Conditional Distribution Inverse Method in Generating Uniform Random Vectors Over a Simplex. Commun. Stat. Simul. Comput. 40(5): 685-693 (2011)
2000 – 2009
- 2006
- [j2]Hassan Shavandi, Hashem Mahlooji:
A fuzzy queuing location model with a genetic algorithm for congested systems. Appl. Math. Comput. 181(1): 440-456 (2006)
1990 – 1999
- 1995
- [j1]Hashem Mahlooji:
Generating Antithetic Random Variates in Simulation of a Replacement Process by Rejection Method. Simul. 65(2): 94-100 (1995)
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:56 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:
