default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Molla-Alizadeh-Zavardehi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Nahid Farzan, Ali Mahmoodirad
, Sadegh Niroomand, Saber Molla-Alizadeh-Zavardehi:
A sustainable uncertain integrated supply chain network design and assembly line balancing problem with U-shaped assembly lines and multi-mode demand. Soft Comput. 28(4): 2967-2986 (2024)- 2022
- [j11]Golara Chaharmahali, Davoud Ghandalipour, Milad Jasemi, Saber Molla-Alizadeh-Zavardehi:
Modified metaheuristic algorithms to design a closed-loop supply chain network considering quantity discount and fixed-charge transportation. Expert Syst. Appl. 202: 117364 (2022) - 2020
- [j10]Ramazan Sahin, Sadegh Niroomand, Esra Duygu Durmaz, Saber Molla-Alizadeh-Zavardehi:
Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem. Ann. Oper. Res. 295(1): 313-336 (2020) - [j9]Abbas Shoja, S. Molla-Alizadeh-Zavardehi, Sadegh Niroomand:
Hybrid adaptive simplified human learning optimization algorithms for supply chain network design problem with possibility of direct shipment. Appl. Soft Comput. 96: 106594 (2020) - [j8]Mojtaba Akbari, Saber Molla-Alizadeh-Zavardehi, Sadegh Niroomand:
Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network. Oper. Res. 20(1): 447-471 (2020)
2010 – 2019
- 2019
- [j7]I. Bavarsad Salehpoor, S. Molla-Alizadeh-Zavardehi:
A constrained portfolio selection model at considering risk-adjusted measure by using hybrid meta-heuristic algorithms. Appl. Soft Comput. 75: 233-253 (2019) - [j6]Abbas Shoja, S. Molla-Alizadeh-Zavardehi, Sadegh Niroomand:
Adaptive meta-heuristic algorithms for flexible supply chain network design problem with different delivery modes. Comput. Ind. Eng. 138 (2019) - 2016
- [j5]Sadegh Niroomand, Abdollah Hadi-Vencheh, Nima Mirzaei, Saber Molla-Alizadeh-Zavardehi:
Hybrid greedy algorithms for fuzzy tardiness/earliness minimisation in a special single machine scheduling problem: case study and generalisation. Int. J. Comput. Integr. Manuf. 29(8): 870-888 (2016) - 2013
- [j4]S. Molla-Alizadeh-Zavardehi, Soheil Sadi-Nezhad, Reza Tavakkoli-Moghaddam, Mehdi Yazdani:
Solving a fuzzy fixed charge solid transportation problem by metaheuristics. Math. Comput. Model. 57(5-6): 1543-1558 (2013) - 2011
- [j3]S. Molla-Alizadeh-Zavardehi, Mostafa Hajiaghaei-Keshteli, Reza Tavakkoli-Moghaddam:
Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation. Expert Syst. Appl. 38(8): 10462-10474 (2011) - 2010
- [j2]Mostafa Hajiaghaei-Keshteli, S. Molla-Alizadeh-Zavardehi, Reza Tavakkoli-Moghaddam:
Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm. Comput. Ind. Eng. 59(2): 259-271 (2010) - [j1]Mohsen Rostamian Delavar, Mostafa Hajiaghaei-Keshteli, S. Molla-Alizadeh-Zavardehi:
Genetic algorithms for coordinated scheduling of production and air transportation. Expert Syst. Appl. 37(12): 8255-8266 (2010)
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-24 23:04 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:
