![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Haitham Seada
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Xian Yu
, Siqian Shen, Babak Badri-Koohi
, Haitham Seada
:
Time window optimization for attended home service delivery under multiple sources of uncertainties. Comput. Oper. Res. 150: 106045 (2023) - 2021
- [j5]Julian Blank
, Kalyanmoy Deb
, Yashesh D. Dhebar
, Sunith Bandaru
, Haitham Seada
:
Generating Well-Spaced Points on a Unit Simplex for Evolutionary Many-Objective Optimization. IEEE Trans. Evol. Comput. 25(1): 48-60 (2021)
2010 – 2019
- 2019
- [j4]Haitham Seada
, Mohamed Abouhawwash
, Kalyanmoy Deb
:
Multiphase Balance of Diversity and Convergence in Multiobjective Optimization. IEEE Trans. Evol. Comput. 23(3): 503-513 (2019) - [c5]Kalyanmoy Deb
, Sunith Bandaru, Haitham Seada:
Generating Uniformly Distributed Points on a Unit Simplex for Evolutionary Many-Objective Optimization. EMO 2019: 179-190 - 2018
- [p1]Haitham Seada, Kalyanmoy Deb:
Non-dominated Sorting Based Multi/Many-Objective Optimization: Two Decades of Research and Application. Multi-Objective Optimization 2018: 1-24 - 2017
- [j3]Mohamed Abouhawwash
, Haitham Seada, Kalyanmoy Deb:
Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search. Comput. Oper. Res. 79: 331-346 (2017) - [j2]Kalyanmoy Deb, Mohamed Abouhawwash
, Haitham Seada:
A Computationally Fast Convergence Measure and Implementation for Single-, Multiple-, and Many-Objective Optimization. IEEE Trans. Emerg. Top. Comput. Intell. 1(4): 280-293 (2017) - [c4]Haitham Seada, Mohamed Abouhawwash
, Kalyanmoy Deb:
Towards a Better Balance of Diversity and Convergence in NSGA-III: First Results. EMO 2017: 545-559 - 2016
- [j1]Haitham Seada, Kalyanmoy Deb:
A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives. IEEE Trans. Evol. Comput. 20(3): 358-369 (2016) - [c3]Haitham Ahmed Seada, Mohamed Abouhawwash
, Kalyanmoy Deb:
Towards a Better Diversity of Evolutionary Multi-Criterion Optimization Algorithms using Local Searches. GECCO (Companion) 2016: 77-78 - 2015
- [c2]Haitham Seada, Kalyanmoy Deb:
Effect of selection operator on NSGA-III in single, multi, and many-objective optimization. CEC 2015: 2915-2922 - [c1]Haitham Seada, Kalyanmoy Deb:
U-NSGA-III: A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives: Proof-of-Principle Results. EMO (2) 2015: 34-49
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint