default search action
Ali Ghodratnama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Hamed Karimi
, Niaz Wassan, Behdad Ehsani
Optimizing COVID-19 medical waste management using goal and robust possibilistic programming. Eng. Appl. Artif. Intell. 131: 107838 (2024) - [j21]Zahra Rezaali, Ali Ghodratnama, Mehdi Amiri-Aref
Lagrangian relaxation method for solving a new time-dependent production-distribution planning model. Expert Syst. Appl. 255: 124669 (2024) - [i1]Kamyab Karimi, Ali Ghodratnama, Reza Tavakkoli-Moghaddam:
Two new feature selection methods based on learn-heuristic techniques for breast cancer prediction: A comprehensive analysis. CoRR abs/2407.14631 (2024) - 2023
- [j20]Kamyab Karimi
Two new feature selection methods based on learn-heuristic techniques for breast cancer prediction: a comprehensive analysis. Ann. Oper. Res. 328(1): 665-700 (2023) - [j19]Ali Ghodratnama
Solving a new bi-objective mathematical model for a hybrid flow shop scheduling problem with robots and fuzzy maintenance time. Comput. Ind. Eng. 182: 109349 (2023) - [j18]Alireza Amini
Mathematical modeling of a competitive transportation-location arc routing problem. Comput. Ind. Eng. 182: 109400 (2023) - 2022
- [j17]Farzin Ziya-Gorabi, Ali Ghodratnama, Reza Tavakkoli-Moghaddam, Mohammad Saviz Asadi-Lari
A new fuzzy tri-objective model for a home health care problem with green ambulance routing and congestion under uncertainty. Expert Syst. Appl. 201: 117093 (2022) - [j16]Mahsa Pouraliakbari-Mamaghani, Ali Ghodratnama, Seyed Hamid Reza Pasandideh
A robust possibilistic programming approach for blood supply chain network design in disaster relief considering congestion. Oper. Res. 22(3): 1987-2032 (2022) - [j15]Shabnam Rekabi
Designing pharmaceutical supply chain networks with perishable items considering congestion. Oper. Res. 22(4): 4159-4219 (2022) - [j14]Sepideh Azadbakhsh, Ali Ghodratnama
Solving a new bi-objective multi-echelon supply chain problem with a Jackson open-network issue under uncertainty. Soft Comput. 26(4): 1961-2007 (2022) - 2021
- [j13]Vahid Nazari-Ghanbarloo
Optimizing a robust tri-objective multi-period reliable supply chain network considering queuing system and operational and disruption risks. Oper. Res. 21(3): 1963-2020 (2021) - 2020
- [j12]Ali Ghodratnama, Hamidreza Arbabi, Amir Azaron:
A bi˗objective hub location-allocation model considering congestion. Oper. Res. 20(4): 2427-2466 (2020)
2010 – 2019
- 2019
- [j11]Ali Ghodratnama, Hamidreza Arbabi, Amir Azaron:
Production planning in industrial townships modeled as hub location-allocation problems considering congestion in manufacturing plants. Comput. Ind. Eng. 129: 479-501 (2019) - [j10]Soheyl Khalilpourazari
Robust possibilistic programming for multi-item EOQ model with defective supply batches: Whale Optimization and Water Cycle Algorithms. Neural Comput. Appl. 31(10): 6587-6614 (2019) - 2017
- [j9]Ali Ghodratnama, Reza Hassannia, Abolfazl Mirzazadeh:
A fuzzy goal programming approach to solve a novel supply chain multi-objective mathematical model under uncertainty. Int. J. Bus. Perform. Supply Chain Model. 9(4): 280-314 (2017) - [j8]Mansoureh Ramezani Farani, Mohammad Mohammadi, Ali Ghodratnama:
The issue of maintenance and repairment of machines in a production system with the possibility of enhancing the performance of workers: a numerical illustration. Int. J. Math. Oper. Res. 10(4): 462-484 (2017) - 2015
- [j7]Ali Ghodratnama, Reza Tavakkoli-Moghaddam
Robust and fuzzy goal programming optimization approaches for a novel multi-objective hub location-allocation problem: A supply chain overview. Appl. Soft Comput. 37: 255-276 (2015) - [j6]Ali Ghodratnama, Reza Tavakkoli-Moghaddam
A stochastic approach for a novel p-hub location-allocation problem with opening and reopening modes. Int. J. Bus. Perform. Supply Chain Model. 7(4): 305-337 (2015) - [j5]Ali Ghodratnama, Reza Tavakkoli-Moghaddam
Solving a novel multi-objective uncapacitated hub location problemby five meta-heuristics. J. Intell. Fuzzy Syst. 28(6): 2457-2469 (2015) - 2013
- [j4]Behnam Vahdani
Soft computing based on new interval-valued fuzzy modified multi-criteria decision-making method. Appl. Soft Comput. 13(1): 165-172 (2013) - 2010
- [j3]Reza Tavakkoli-Moghaddam
The use of a fuzzy multi-objective linear programming for solving a multi-objective single-machine scheduling problem. Appl. Soft Comput. 10(3): 919-925 (2010)
2000 – 2009
- 2009
- [j2]Reza Tavakkoli-Moghaddam
A simulated annealing method for solving a new mathematical model of a multi-criteria cell formation problem with capital constraints. Adv. Eng. Softw. 40(4): 268-273 (2009) - 2005
- [j1]Reza Tavakkoli-Moghaddam
Allocation of parts to cells, minimising tardiness and idle time by simulated annealing. Int. J. Manuf. Technol. Manag. 7(5/6): 581-593 (2005)
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-08-23 19:24 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: