default search action
Farnaz Barzinpour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Ali Bahrami
, Rouzbeh Ghousi
Presenting a Two-Stage Hybrid Model for Allocating Advanced Ventilators Using Machine Learning Methods: A Case Study. IEEE Access 12: 151317-151330 (2024) - [j21]Amin Reza Kalantari Khalil Abad
Green and reliable medical device supply chain network design under deep dynamic uncertainty: A novel approach in the context of COVID-19 outbreak. Appl. Soft Comput. 149(Part A): 110964 (2024) - [j20]Morteza Rakhshaninejad
Refining breast cancer biomarker discovery and drug targeting through an advanced data-driven approach. BMC Bioinform. 25(1): 33 (2024) - 2023
- [j19]Amin Reza Kalantari Khalil Abad
Toward circular economy for pomegranate fruit supply chain under dynamic uncertainty: A case study. Comput. Chem. Eng. 178: 108362 (2023) - 2022
- [j18]Elham Abdollahi Saadatlu, Farnaz Barzinpour
A sustainable model for municipal solid waste system considering global warming potential impact: A case study. Comput. Ind. Eng. 169: 108127 (2022) - [j17]Bahareh Aghababaei, Mir Saman Pishvaee, Farnaz Barzinpour
A fuzzy bi-level programming approach to scarce drugs supply and ration planning problem under risk. Fuzzy Sets Syst. 434: 48-72 (2022) - [j16]Tahereh Hashemi
Short lifetime product supply chain coordination and social benefit considering cannibalization effect and market segmentation. RAIRO Oper. Res. 56(3): 1781-1805 (2022) - 2020
- [j15]Hamed Farrokhi-asl
Solving a multi-objective sustainable waste collection problem considering a new collection network. Oper. Res. 20(4): 1977-2015 (2020)
2010 – 2019
- 2019
- [j14]Bahareh Aghababaei, Mir Saman Pishvaee
A two-stage fuzzy optimization model for scarce drugs supply and ration planning under uncertainty: A case study. Appl. Soft Comput. 81 (2019) - [j13]Farhad Habibi
A mathematical model for project scheduling and material ordering problem with sustainability considerations: A case study in Iran. Comput. Ind. Eng. 128: 690-710 (2019) - [j12]Vahid Mahmoodian, Armin Jabbarzadeh
A novel intelligent particle swarm optimization algorithm for solving cell formation problem. Neural Comput. Appl. 31(S-2): 801-815 (2019) - 2018
- [j11]Farnaz Barzinpour
A dual-channel network design model in a green supply chain considering pricing and transportation mode choice. J. Intell. Manuf. 29(7): 1465-1483 (2018) - 2016
- [j10]Peyman Taki, Farnaz Barzinpour
Risk-pooling strategy, lead time, delivery reliability and inventory control decisions in a stochastic multi-objective supply chain network design. Ann. Oper. Res. 244(2): 619-646 (2016) - 2015
- [j9]Mehrdad Agha Mohammad Ali Kermani, Alireza Aliahmadi, Vahid Reza Salamat, Farnaz Barzinpour
Supplier selection in a single-echelon supply chain with horizontal competition using Imperialist competitive algorithm. Int. J. Comput. Integr. Manuf. 28(6): 628-638 (2015) - 2014
- [j8]Javid Jouzdani
Applying Simulated Annealing to a generalized Cell Formation Problem considering Alternative Routings and Machine reliability. Asia Pac. J. Oper. Res. 31(4) (2014) - [j7]Farnaz Barzinpour
Metaheuristic Algorithm for Solving Biobjective Possibility Planning Model of Location-Allocation in Disaster Relief Logistics. J. Appl. Math. 2014: 239868:1-239868:17 (2014) - 2013
- [j6]Ali Saboury, Nader Ghaffari-Nasab
Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks. Comput. Oper. Res. 40(10): 2493-2507 (2013) - 2012
- [j5]Reza Ramezanian
An aggregate production planning model for two phase production systems: Solving with genetic algorithm and tabu search. Expert Syst. Appl. 39(1): 1256-1263 (2012) - [j4]Mohamad Saeed Jabalameli, Farnaz Barzinpour, Ali Saboury, Nader Ghaffari-Nasab:
A simulated annealing-based heuristic for the single allocation maximal covering hub location problem. Int. J. Metaheuristics 2(1): 15-37 (2012) - 2011
- [j3]Ata Allah Taleizadeh, Seyed Taghi Akhavan Niaki
Multiple-buyer multiple-vendor multi-product multi-constraint supply chain problem with stochastic demand and variable lead-time: A harmony search algorithm. Appl. Math. Comput. 217(22): 9234-9253 (2011) - [j2]Ata Allah Taleizadeh, Farnaz Barzinpour
Meta-heuristic algorithms for solving a fuzzy single-period problem. Math. Comput. Model. 54(5-6): 1273-1285 (2011) - 2010
- [j1]Fardin Ahmadizar
A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem. Int. J. Comput. Intell. Syst. 3(6): 853-861 (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-11-07 20:35 CET 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: