Nguyen Thanh Hung

About Nguyen Thanh Hung

Nguyen Thanh Hung, With an exceptional h-index of 5 and a recent h-index of 5 (since 2020), a distinguished researcher at Can Tho University, specializes in the field of mathematical programming, combinatorial optimization, location theory, computer algebra.

His recent articles reflect a diverse array of research interests and contributions to the field:

Unified approach to the inverse median location problem under the sum and the max objectives applying ordered median function

The extensive 1-median problem with radius on networks

The inverse k-max combinatorial optimization problem

A linear time algorithm for connected p-centdian problem on block graphs

The connected -median problem on complete multi-layered graphs

The minmax regret inverse maximum weight problem

The reverse total weighted distance problem on networks with variable edge lengths

Computational aspects of the inverse single facility location problem on trees under lk-norm

Nguyen Thanh Hung Information

University

Position

___

Citations(all)

57

Citations(since 2020)

54

Cited By

24

hIndex(all)

5

hIndex(since 2020)

5

i10Index(all)

2

i10Index(since 2020)

2

Email

University Profile Page

Google Scholar

Nguyen Thanh Hung Skills & Research Interests

mathematical programming

combinatorial optimization

location theory

computer algebra

Top articles of Nguyen Thanh Hung

Unified approach to the inverse median location problem under the sum and the max objectives applying ordered median function

Optimization

2024/4/10

Kien Trung Nguyen
Kien Trung Nguyen

H-Index: 9

Nguyen Thanh Hung
Nguyen Thanh Hung

H-Index: 3

The extensive 1-median problem with radius on networks

Opuscula Mathematica

2024

Nguyen Thanh Hung
Nguyen Thanh Hung

H-Index: 3

Kien Trung Nguyen
Kien Trung Nguyen

H-Index: 9

The inverse k-max combinatorial optimization problem

Yugoslav Journal of Operations Research

2023

Kien Trung Nguyen
Kien Trung Nguyen

H-Index: 9

Nguyen Thanh Hung
Nguyen Thanh Hung

H-Index: 3

A linear time algorithm for connected p-centdian problem on block graphs

Theoretical Computer Science

2022/6/26

The connected -median problem on complete multi-layered graphs

Discrete Mathematics, Algorithms and Applications

2022/4/19

The minmax regret inverse maximum weight problem

Applied Mathematics and Computation

2021/10/15

Kien Trung Nguyen
Kien Trung Nguyen

H-Index: 9

Nguyen Thanh Hung
Nguyen Thanh Hung

H-Index: 3

The reverse total weighted distance problem on networks with variable edge lengths

Filomat

2021

Kien Trung Nguyen
Kien Trung Nguyen

H-Index: 9

Nguyen Thanh Hung
Nguyen Thanh Hung

H-Index: 3

Computational aspects of the inverse single facility location problem on trees under lk-norm

Theoretical Computer Science

2020/12/6

Kien Trung Nguyen
Kien Trung Nguyen

H-Index: 9

Nguyen Thanh Hung
Nguyen Thanh Hung

H-Index: 3

A linear time algorithm for the p-maxian problem on trees with distance constraint

Journal of Combinatorial Optimization

2020/11

Nguyen Thanh Hung
Nguyen Thanh Hung

H-Index: 3

The inverse connected p-median problem on block graphs under various cost functions

Annals of Operations Research

2020/9

Kien Trung Nguyen
Kien Trung Nguyen

H-Index: 9

Nguyen Thanh Hung
Nguyen Thanh Hung

H-Index: 3

See List of Professors in Nguyen Thanh Hung University(Can Tho University)