default search action
Nguyen Duc Nghia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j3]Huynh Thi Thanh Binh
, Nguyen Thi Hanh, La Van Quan, Nguyen Duc Nghia, Nilanjan Dey
Metaheuristics for maximization of obstacles constrained area coverage in heterogeneous wireless sensor networks. Appl. Soft Comput. 86 (2020)
2010 – 2019
- 2019
- [j2]Huynh Thi Thanh Binh
Efficient approximation approaches to minimal exposure path problem in probabilistic coverage model for wireless sensor networks. Appl. Soft Comput. 76: 726-743 (2019) - [c16]Ha Bang Ban
Metaheuristic for the Traveling Repairman Problem with Time Window Constraints. RIVF 2019: 1-6 - 2017
- [j1]Ha Bang Ban, Nguyen Duc Nghia:
A Meta-Heuristic Algorithm Combining Between Tabu and Variable Neighborhood Search for the Minimum Latency Problem. Fundam. Informaticae 156(1): 21-41 (2017) - [c15]Quang Ngoc Nguyen, Nghia Nguyen Duc, Phuong Khanh Nguyen:
An Adaptive Large Neighborhood Search for Multi-trip Multi-traffic Pickup and Delivery problem with Time Windows and Synchronization. SoICT 2017: 439-446 - [c14]Nguyen Thi My Binh, Chu Minh Thang, Nguyen Duc Nghia, Huynh Thi Thanh Binh:
Genetic algorithm for solving minimal exposure path in mobile sensor networks. SSCI 2017: 1-8 - 2016
- [c13]Nguyen Thi Hanh, Phan Thi Hong Hanh, Huynh Thi Thanh Binh, Nguyen Duc Nghia:
Heuristic algorithm for target coverage with connectivity fault-tolerance problem in wireless sensor networks. TAAI 2016: 235-240 - 2015
- [c12]Dinh Thi Ha Ly, Nguyen Thi Hanh, Huynh Thi Thanh Binh, Nguyen Duc Nghia:
An Improved Genetic Algorithm for Maximizing Area Coverage in Wireless Sensor Networks. SoICT 2015: 61-66 - 2014
- [c11]Ha Bang Ban
A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem. SoICT 2014: 39-48 - 2013
- [c10]Ha Bang Ban
A Subgradient Method to Improve Approximation Ratio in the Minimum Latency Problem. KSE (1) 2013: 339-350 - [c9]Ha Bang Ban
A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem. RIVF 2013: 192-197 - [c8]Quoc Phan Tan, Nghia Nguyen Duc:
An experimental study of minimum routing cost spanning tree algorithms. SoCPaR 2013: 158-165 - 2012
- [c7]Ha Bang Ban
An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem. RIVF 2012: 1-4 - 2011
- [c6]Minh Hieu Nguyen, PhanTan Quoc, Nguyen Duc Nghia:
An approach of ant algorithm for solving minimum routing cost spanning tree problem. SoICT 2011: 5-10 - 2010
- [c5]Ha Bang Ban
Improved genetic algorithm for minimum latency problem. SoICT 2010: 9-15
2000 – 2009
- 2009
- [c4]Huynh Thi Thanh Binh, Nguyen Duc Nghia:
New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem. ACIIDS 2009: 283-288 - [c3]Huynh Thi Thanh Binh, Robert I. McKay
New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem. GECCO 2009: 373-380 - 2008
- [c2]Nguyen Viet Huy, Nguyen Duc Nghia:
Solving graphical Steiner tree problem using parallel genetic algorithm. RIVF 2008: 29-35 - 2007
- [c1]Nguyen Duc Nghia, Huynh Thi Thanh Binh:
New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem. RIVF 2007: 108-113
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-04-25 05:50 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: