default search action
Mohamed A. Tawhid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j35]Abdelmonem M. Ibrahim, Mohamed A. Tawhid:
Chaotic electromagnetic field optimization. Artif. Intell. Rev. 56(9): 9989-10030 (2023) - [j34]Abdelmonem M. Ibrahim, Mohamed A. Tawhid:
An improved artificial algae algorithm integrated with differential evolution for job-shop scheduling problem. J. Intell. Manuf. 34(4): 1763-1778 (2023) - [j33]Mohamed A. Tawhid, Abdelmonem M. Ibrahim:
An efficient hybrid swarm intelligence optimization algorithm for solving nonlinear systems and clustering problems. Soft Comput. 27(13): 8867-8895 (2023) - 2022
- [j32]Mohamed A. Tawhid, Abdelmonem M. Ibrahim:
Improved salp swarm algorithm combined with chaos. Math. Comput. Simul. 202: 113-148 (2022) - 2021
- [j31]Mohamed A. Tawhid, A. M. Ibrahim:
Solving nonlinear systems and unconstrained optimization problems by hybridizing whale optimization algorithm and flower pollination algorithm. Math. Comput. Simul. 190: 1342-1369 (2021) - 2020
- [j30]Mohamed A. Tawhid, Abdel-Monem M. Ibrahim:
A hybridization of grey wolf optimizer and differential evolution for solving nonlinear systems. Evol. Syst. 11(1): 65-87 (2020) - [j29]Abdel-Monem M. Ibrahim, Mohamed A. Tawhid, Rabab K. Ward:
A binary water wave optimization for feature selection. Int. J. Approx. Reason. 120: 74-91 (2020) - [j28]Mohamed A. Tawhid, Abdel-Monem M. Ibrahim:
Feature selection based on rough set approach, wrapper approach, and binary whale optimization algorithm. Int. J. Mach. Learn. Cybern. 11(3): 573-602 (2020) - [p1]Mohamed A. Tawhid, Abdel-Monem M. Ibrahim:
Hybrid Binary Particle Swarm Optimization and Flower Pollination Algorithm Based on Rough Set Approach for Feature Selection Problem. Nature-Inspired Computation in Data Mining and Machine Learning 2020: 249-273
2010 – 2019
- 2019
- [j27]Abdel-Monem M. Ibrahim, Mohamed A. Tawhid:
A hybridization of cuckoo search and particle swarm optimization for solving nonlinear systems. Evol. Intell. 12(4): 541-561 (2019) - [j26]Surafel Luleseged Tilahun, Mohamed A. Tawhid:
Swarm hyperheuristic framework. J. Heuristics 25(4-5): 809-836 (2019) - [j25]Mohamed A. Tawhid, Ahmed Fouad Ali:
Multidirectional harmony search algorithm for solving integer programming and minimax problems. Int. J. Bio Inspired Comput. 13(3): 141-158 (2019) - [j24]Mohamed A. Tawhid, Kevin B. Dsouza:
Solving feature selection problem by hybrid binary genetic enhanced particle swarm optimization algorithm. Int. J. Hybrid Intell. Syst. 15(4): 207-219 (2019) - [j23]Abdel-Monem M. Ibrahim, Mohamed A. Tawhid:
A hybridization of differential evolution and monarch butterfly optimization for solving systems of nonlinear equations. J. Comput. Des. Eng. 6(3): 354-367 (2019) - [j22]Mohamed A. Tawhid, Vimal J. Savsani:
Multi-objective sine-cosine algorithm (MO-SCA) for multi-objective engineering design problems. Neural Comput. Appl. 31(S-2): 915-929 (2019) - 2018
- [j21]Mohamed A. Tawhid, Vimal J. Savsani:
A novel multi-objective optimization algorithm based on artificial algae for multi-objective engineering design problems. Appl. Intell. 48(10): 3762-3781 (2018) - [j20]Mohamed A. Tawhid, Ahmed Fouad Ali:
Multidirectional Grey Wolf Optimizer Algorithm for Solving Global Optimization Problems. Int. J. Comput. Intell. Appl. 17(4): 1850022:1-1850022:25 (2018) - [j19]Ahmed Fouad Ali, Mohamed A. Tawhid:
Hybrid bat algorithm and direct search methods for solving minimax problems. Int. J. Hybrid Intell. Syst. 14(4): 209-223 (2018) - [j18]Mohamed A. Tawhid, Vimal J. Savsani:
∊-constraint heat transfer search (∊-HTS) algorithm for solving multi-objective engineering design problems. J. Comput. Des. Eng. 5(1): 104-119 (2018) - [j17]Mohamed A. Tawhid, Kevin B. Dsouza:
Hybrid binary dragonfly enhanced particle swarm optimization algorithm for solving feature selection problems. Math. Found. Comput. 1(2): 181-200 (2018) - [j16]Poonam Savsani, Mohamed A. Tawhid:
Discrete heat transfer search for solving travelling salesman problem. Math. Found. Comput. 1(3): 265-280 (2018) - [j15]Mohamed A. Tawhid, Ahmed Fouad Ali:
An effective hybrid firefly algorithm with the cuckoo search for engineering optimization problems. Math. Found. Comput. 1(4): 349-368 (2018) - [j14]Mohamed A. Tawhid, Saeed Rahmati:
Complementarity problems over a hypermatrix (tensor) set. Optim. Lett. 12(6): 1443-1454 (2018) - 2017
- [j13]Vimal J. Savsani, Mohamed A. Tawhid:
Non-dominated sorting moth flame optimization (NS-MFO) for multi-objective problems. Eng. Appl. Artif. Intell. 63: 20-32 (2017) - [j12]Mohamed A. Tawhid, Ahmed Fouad Ali:
A Hybrid grey wolf optimizer and genetic algorithm for minimizing potential energy function. Memetic Comput. 9(4): 347-359 (2017) - [j11]Mohamed A. Tawhid, Ahmed Fouad Ali:
A hybrid social spider optimization and genetic algorithm for minimizing molecular potential energy function. Soft Comput. 21(21): 6499-6514 (2017) - 2016
- [j10]Mohamed A. Tawhid, Ahmed Fouad Ali:
A simplex social spider algorithm for solving integer programming and minimax problems. Memetic Comput. 8(3): 169-188 (2016) - 2015
- [j9]Ahmed Ali, Mohamed A. Tawhid:
Hybrid Particle Swarm Optimization with a Modified Arithmetical Crossover for Solving Unconstrained Optimization Problems. INFOR Inf. Syst. Oper. Res. 53(3): 125-141 (2015) - 2014
- [j8]Muhammad Mazhar Abbas, Mohamed A. Tawhid, Khalid Saleem, Muhammad Zia, Nazar Abbas Saqib, Hafiz Malik, Hasan Mahmood:
Solar Energy Harvesting and Management in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 10 (2014) - [j7]Qurratul-Ain Minhas, Mohamed A. Tawhid, Hasan Mahmood:
Efficient Power and Channel Allocation Strategies in Cooperative Potential Games for Cognitive Radio Sensor Networks. Int. J. Distributed Sens. Networks 10 (2014) - [j6]Mohamed A. Tawhid, Hasan Mahmood:
Recent Trends in Wireless Sensor Networks with Applications. Int. J. Distributed Sens. Networks 10 (2014)
2000 – 2009
- 2009
- [c1]Mohamed A. Tawhid:
Derivative-free descent method for nonlinear complementarity problem via square Penalized Fischer-Burmeister function. INDIN 2009: 210-215 - 2008
- [j5]Mohamed A. Tawhid:
An application of H-differentiability to nonnegative and unrestricted generalized complementarity problems. Comput. Optim. Appl. 39(1): 51-74 (2008) - 2007
- [j4]Mohamed A. Tawhid:
On minimizing the implicit Lagrangian for nonlinear complementarity problems under H-differentiability. Appl. Math. Comput. 185(1): 484-491 (2007) - 2006
- [j3]Mohamed A. Tawhid:
On strictly semi-monotone (semi-monotone) properties in nonsmooth functions. Appl. Math. Comput. 175(2): 1609-1618 (2006) - 2000
- [j2]Mohamed A. Tawhid, M. Seetharama Gowda:
On Two Applications of H-Differentiability to Optimization and Complementarity Problems. Comput. Optim. Appl. 17(2-3): 279-299 (2000)
1990 – 1999
- 1999
- [j1]M. Seetharama Gowda, Mohamed A. Tawhid:
Existence and Limiting Behavior of Trajectories Associated with P0-equations. Comput. Optim. Appl. 12(1-3): 229-251 (1999)
Coauthor Index
aka: Abdelmonem M. Ibrahim
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-12-26 01:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint