default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNguyen Binh Long
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j6]Pham Dinh Thanh, Nguyen Binh Long, Le Sy Vinh, Huynh Thi Thanh Binh:
Evolutionary multitasking algorithm based on a dynamic solution encoding strategy for the minimum s-club cover problem. Evol. Intell. 18(1): 15 (2025)- 2024
- [j5]Tuan Anh Do
, Ha-Bang Ban, Thi Thanh Binh Huynh, Minh Tu Le, Nguyen Binh Long:
Genetic algorithm based approach to solve the Clustered Steiner Tree Problem. Evol. Intell. 17(3): 1547-1566 (2024) - [j4]Nguyen Binh Long, Do Tuan Anh, Ha-Bang Ban, Huynh Thi Thanh Binh:
A multipopulation multitasking evolutionary scheme with adaptive knowledge transfer to solve the clustered minimum routing cost tree problem. Inf. Sci. 657: 119961 (2024) - [j3]Nguyen Binh Long, Do Tuan Anh, Ha-Bang Ban, Huynh Thi Thanh Binh:
An online transfer learning based multifactorial evolutionary algorithm for solving the clustered Steiner tree problem. Knowl. Based Syst. 296: 111870 (2024) - 2021
- [j2]Ta Bao Thang, Nguyen Binh Long, Ngo Viet Hoang, Huynh Thi Thanh Binh:
Adaptive Knowledge Transfer in Multifactorial Evolutionary Algorithm for the Clustered Minimum Routing Cost Problem. Appl. Soft Comput. 105: 107253 (2021) - 2020
- [j1]Pham Dinh Thanh, Huynh Thi Thanh Binh, Tran Ba Trung, Nguyen Binh Long:
Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codes. Memetic Comput. 12(3): 185-217 (2020)
Conference and Workshop Papers
- 2020
- [c2]Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Binh Long, Ngo Viet Hoang, Pham Dinh Thanh:
Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint. CEC 2020: 1-8 - 2019
- [c1]Pham Dinh Thanh, Huynh Thi Thanh Binh, Do Dinh Dac, Nguyen Binh Long, Le Minh Hai Phong:
A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem. CEC 2019: 2915-2922
Informal and Other Publications
- 2020
- [i1]Pham Dinh Thanh, Huynh Thi Thanh Binh, Do Dinh Dac, Nguyen Binh Long, Le Minh Hai Phong:
A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem. CoRR abs/2005.04095 (2020)
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-12-11 21:42 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:
