Binh-Long Nguyen

Binh-Long Nguyen

PhD Candidate

Sitemap

A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.

Pages

Posts

Future Blog Post

less than 1 minute read

Published:

This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

Blog Post number 4

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 3

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 2

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 1

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

portfolio

publications

A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem

Published in 2019 IEEE Congress on Evolutionary Computation (CEC), 2019

We introduce a new algorithm that combines the major features of Randomized Greedy Algorithms (RGAs) and Shortest Path Tree Algorithm (SPTA) to deal with the Clustered Shortest-Path Tree Problem (CluSPT)

Recommended citation: Thanh, P. D., Binh, H. T. T., & Long, N. B. (2019, June). "A heuristic based on randomized greedy algorithms for the clustered shortest-path tree problem." In 2019 IEEE Congress on Evolutionary Computation (CEC) (pp. 2915-2922). IEEE.
Download Paper

Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codes

Published in Memetic Computing, 2020

An MFEA with Cayley-code representations for clustered tree problems, evaluating Prüfer, Dandelion, and Blob encodings on CluSPT and related problems.

Recommended citation: Dinh, T. P., Thanh, B. H. T., Ba, T. T., & Long, N. B. (2020). "Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codes." Memetic Computing, 12, 185–217.
Download Paper

Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint

Published in 2020 IEEE Congress on Evolutionary Computation (CEC), 2020

An MFEA with priority-based encoding for Inter-Domain Path Computation under Domain Uniqueness constraint (IDPC-DU), with crossover and mutation operators that always produce valid solutions.

Recommended citation: Huynh, T. T. B., Ta, B. T., Long, N. B., Nguyen, V. H., & Pham, D. T. (2020, July). "Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint." In 2020 IEEE Congress on Evolutionary Computation (CEC) (pp. 1-8). IEEE.
Download Paper

Adaptive Knowledge Transfer in Multifactorial Evolutionary Algorithm for the Clustered Minimum Routing Cost Problem

Published in Applied Soft Computing, 2021

An adaptive knowledge transfer mechanism in a multifactorial evolutionary algorithm for the clustered minimum routing cost problem.

Recommended citation: Thang, T. B., Long, N. B., Hoang, N. V., & Binh, H. T. T. (2021). "Adaptive Knowledge Transfer in Multifactorial Evolutionary Algorithm for the Clustered Minimum Routing Cost Problem." Applied Soft Computing, 105, 107253.
Download Paper

Genetic algorithm based approach to solve the Clustered Steiner Tree Problem

Published in Evolutionary Intelligence, 2023

A Shortest-Path Genetic Algorithm with a permutation-based representation for solving the Clustered Steiner Tree Problem in Euclidean and non-Euclidean cases.

Recommended citation: Do, T. A., Ban, H. B., Huynh, T. T. B., Le, M. T., & Nguyen, B. L. (2024). "Genetic algorithm based approach to solve the Clustered Steiner Tree Problem." Evolutionary Intelligence, 17, 1547–1566.
Download Paper

A multipopulation multitasking evolutionary scheme with adaptive knowledge transfer to solve the clustered minimum routing cost tree problem

Published in Information Sciences, 2023

A multipopulation multitasking evolutionary scheme with adaptive knowledge transfer for the clustered minimum routing cost tree problem.

Recommended citation: Long, N. B., Anh, D. T., Ban, H. B., & Binh, H. T. T. (2024). "A multipopulation multitasking evolutionary scheme with adaptive knowledge transfer to solve the clustered minimum routing cost tree problem." Information Sciences, 657, 119961.
Download Paper

An online transfer learning based multifactorial evolutionary algorithm for solving the clustered Steiner tree problem

Published in Knowledge-Based Systems, 2024

An online transfer learning based multifactorial evolutionary algorithm for solving the clustered Steiner tree problem.

Recommended citation: Long, N. B., Anh, D. T., Ban, H. B., & Binh, H. T. T. (2024). "An online transfer learning based multifactorial evolutionary algorithm for solving the clustered Steiner tree problem." Knowledge-Based Systems, 296, 111870.
Download Paper

Evolutionary multitasking algorithm based on a dynamic solution encoding strategy for the minimum s-club cover problem

Published in Evolutionary Intelligence, 2024

A multitasking evolutionary algorithm with a dynamic solution encoding strategy for the minimum s-club cover problem, evaluated on DIMACS datasets.

Recommended citation: Thanh, P. D., Long, N. B., Vinh, L. S., & Binh, H. T. T. (2024). "Evolutionary multitasking algorithm based on a dynamic solution encoding strategy for the minimum s-club cover problem." Evolutionary Intelligence, 18, 15.
Download Paper

Ilov3Splat: Instance-Level Open-Vocabulary 3D Scene Understanding in Gaussian Splatting

Published in International Conference on Pattern Recognition (ICPR 2026), 2026

A framework for instance-level open-vocabulary 3D scene understanding built on 3D Gaussian Splatting, enabling language-driven object identification without category supervision.

Recommended citation: Nguyen, B. L., Nguyen, K., Sridharan, S., Fookes, C., & Moghadam, P. (2026). "Ilov3Splat: Instance-Level Open-Vocabulary 3D Scene Understanding in Gaussian Splatting." In Pattern Recognition (ICPR 2026). Lecture Notes in Computer Science, vol 16816. Springer, Cham.
Download Paper

talks

teaching