default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPham Dinh Thanh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]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)- 2023
- [j8]Do Tuan Anh
, Huynh Thi Thanh Binh, Nguyen Duc Thai, Pham Dinh Thanh:
A Particle Swarm Optimization and Variable Neighborhood Search based multipopulation algorithm for Inter-Domain Path Computation problem. Appl. Soft Comput. 136: 110063 (2023) - 2022
- [j7]Huynh Thi Thanh Binh, Pham Dinh Thanh:
Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem. Evol. Intell. 15(1): 185-213 (2022) - 2021
- [j6]Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai, Pham Dinh Thanh:
A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization. Eng. Appl. Artif. Intell. 100: 104187 (2021) - [j5]Phan Thi Hong Hanh, Pham Dinh Thanh, Huynh Thi Thanh Binh:
Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem. Inf. Sci. 553: 280-304 (2021) - [i7]Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai, Pham Dinh Thanh:
A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization. CoRR abs/2102.09954 (2021) - 2020
- [j4]Pham Dinh Thanh, Huynh Thi Thanh Binh, Tran Ba Trung:
An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem. Appl. Intell. 50(4): 1233-1258 (2020) - [j3]Thi Thanh Binh Huynh, Dinh Thanh Pham, Tran Ba Trung, Le Cong Thanh, Le Minh Hai Phong, Ananthram Swami, Lam Thu Bui:
A multifactorial optimization paradigm for linkage tree genetic algorithm. Inf. Sci. 540: 325-344 (2020) - [j2]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) - [c9]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 - [i6]Pham Dinh Thanh, Huynh Thi Thanh Binh, Lam Thu Bui:
New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem. CoRR abs/2001.11590 (2020) - [i5]Huynh Thi Thanh Binh, Pham Dinh Thanh, Tran Ba Trung, Le Cong Thanh, Le Minh Hai Phong, Ananthram Swami, Lam Thu Bui:
A Multifactorial Optimization Paradigm for Linkage Tree Genetic Algorithm. CoRR abs/2005.03090 (2020) - [i4]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) - [i3]Phan Thi Hong Hanh, Pham Dinh Thanh, Huynh Thi Thanh Binh:
Evolutionary Algorithm and Multifactorial Evolutionary Algorithm on Clustered Shortest-Path Tree problem. CoRR abs/2010.09309 (2020)
2010 – 2019
- 2019
- [j1]Huynh Thi Thanh Binh, Pham Dinh Thanh, Ta Bao Thang:
New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm. Knowl. Based Syst. 180: 12-25 (2019) - [c8]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 - [c7]Tran Ba Trung, Le Tien Thanh, Ly Trung Hieu, Pham Dinh Thanh, Huynh Thi Thanh Binh:
Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem. SoICT 2019: 170-177 - [i2]Huynh Thi Thanh Binh, Pham Dinh Thanh, Ta Bao Thang:
New Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm. CoRR abs/1908.07060 (2019) - [i1]Tran Ba Trung, Huynh Thi Thanh Binh, Le Tien Thanh, Ly Trung Hieu, Pham Dinh Thanh:
Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem. CoRR abs/1912.10986 (2019) - 2018
- [c6]Huynh Thi Thanh Binh, Pham Dinh Thanh, Tran Ba Trung, Le Phuong Thao:
Effective Multifactorial Evolutionary Algorithm for Solving the Cluster Shortest Path Tree Problem. CEC 2018: 1-8 - [c5]Pham Dinh Thanh, Dinh Anh Dung, Tran Ngoc Tien, Huynh Thi Thanh Binh:
An Effective Representation Scheme in Multifactorial Evolutionary Algorithm for Solving Cluster Shortest-Path Tree Problem. CEC 2018: 1-8 - 2015
- [c4]Dinh Thanh Pham, Thi Thanh Binh Huynh:
An effective combination of Genetic Algorithms and the Variable Neighborhood Search for solving Travelling Salesman Problem. TAAI 2015: 142-149 - [c3]Dinh Thanh Pham, Thi Thanh Binh Huynh, Nguyen Quang Manh:
The new crossover operators and a novel combination of crossover operators for solving Linear Ordering Problem. TAAI 2015: 150-157 - 2014
- [c2]Pham Dinh Thanh, Huynh Thi Thanh Binh, Lam Thu Bui:
New Mechanism of Combination Crossover Operators in Genetic Algorithm for Solving the Traveling Salesman Problem. KSE 2014: 367-379 - 2013
- [c1]Pham Dinh Thanh, Huynh Thi Thanh Binh, Lam Thu Bui:
A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem. SoCPaR 2013: 66-71
Coauthor Index
aka: Thi Thanh Binh Huynh
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 2025-01-21 00:15 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:
