( en | de | ru )

 

Disambiguation of "Nghia, Nguyen Duc"

Author of the publication

copydeleteadd this publication to your clipboard
New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem.

, and . RIVF, page 108-113. IEEE, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nguyen Duc Nghia

Hoang-Duc-Nghia

Duc-Dang Nghia

Nghia Duc Dang

Nguyen Nghia Binh

 

Other publications of authors with the same name

Improved genetic algorithm for minimum latency problem., and . SoICT, volume 449 of ACM International Conference Proceeding Series, page 9-15. ACM, (2010)Solving graphical Steiner tree problem using parallel genetic algorithm., and . RIVF, page 29-35. IEEE, (2008)Efficient approximation approaches to minimal exposure path problem in probabilistic coverage model for wireless sensor networks., , , , and . Appl. Soft Comput., (2019)An approach of ant algorithm for solving minimum routing cost spanning tree problem., , and . SoICT, page 5-10. ACM, (2011)An experimental study of minimum routing cost spanning tree algorithms., and . SoCPaR, page 158-165. IEEE, (2013)A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem., and . SoICT, page 39-48. ACM, (2014)Genetic algorithm for solving minimal exposure path in mobile sensor networks., , , and . SSCI, page 1-8. IEEE, (2017)A Subgradient Method to Improve Approximation Ratio in the Minimum Latency Problem., and . KSE (1), volume 244 of Advances in Intelligent Systems and Computing, page 339-350. Springer, (2013)A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem., and . RIVF, page 192-197. IEEE, (2013)An Adaptive Large Neighborhood Search for Multi-trip Multi-traffic Pickup and Delivery problem with Time Windows and Synchronization., , and . SoICT, page 439-446. ACM, (2017)