Huong Nguyen-Thu

According to our database, Huong Nguyen-Thu authored at least 9 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

The max-sum inverse median location problem on trees with budget constraint.

Huong Nguyen-Thu, Kien Trung Nguyen, Nguyen Thanh Toan

Appl. Math. Comput., January, 2024

Swarm optimization approaches for the minmax regret Fermat-Weber problem with budgeted-constrained uncertain point weights.

Huong Nguyen-Thu, Nguyen Thanh Hung, Nguyen Ngoc Dang Duy

Evol. Intell., 2024

2023

The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights.

Tran Hoai Ngoc Nhan, Kien Trung Nguyen, Huong Nguyen-Thu

Asia Pac. J. Oper. Res., June, 2023

2022

A linear time algorithm for connected <i>p</i>-centdian problem on block graphs.

Kien Trung Nguyen, Wen Chean Teh, Nguyen Thanh Hung, Huong Nguyen-Thu

Theor. Comput. Sci., 2022

2020

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

Kien Trung Nguyen, Nguyen Thanh Hung, Huong Nguyen-Thu

J. Comb. Optim., 2020

2018

On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks.

Kien Trung Nguyen, Huong Nguyen-Thu, Nguyen Thanh Hung

Math. Methods Oper. Res., 2018

2014

Strong-stability-preserving, Hermite-Birkhoff time-discretization based on k step methods and 8-stage explicit Runge-Kutta methods of order 5 and 4.

Huong Nguyen-Thu, Truong Nguyen-Ba, Rémi Vaillancourt

J. Comput. Appl. Math., 2014

2012

Strong-Stability-Preserving 7-Stage Hermite-Birkhoff Time-Discretization Methods.

Truong Nguyen-Ba, Huong Nguyen-Thu, Thierry Giordano, Rémi Vaillancourt

J. Sci. Comput., 2012

2011

Strong-Stability-Preserving, K-Step, 5- to 10-Stage, Hermite-Birkhoff Time-Discretizations of Order 12.

Truong Nguyen-Ba, Huong Nguyen-Thu, Rémi Vaillancourt

Am. J. Comput. Math., 2011