Kien Trung Nguyen

Orcid: 0000-0002-7522-4557

According to our database1, Kien Trung Nguyen authored at least 26 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Some robust inverse median problems on trees with interval costs.
Comput. Manag. Sci., December, 2024

An integrated approach for allocation and scheduling-location problems on graphs.
Comput. Appl. Math., April, 2024

The max-sum inverse median location problem on trees with budget constraint.
Appl. Math. Comput., January, 2024

2023
The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights.
Asia Pac. J. Oper. Res., June, 2023

2022
A linear time algorithm for connected <i>p</i>-centdian problem on block graphs.
Theor. Comput. Sci., 2022

The connected p-median problem on complete multi-layered graphs.
Discret. Math. Algorithms Appl., 2022

2021
Ranks of strictly minimal reaction systems induced by permutations.
Theor. Comput. Sci., 2021

On the existence and stability of solutions to stochastic equilibrium problems.
RAIRO Oper. Res., 2021

Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance.
Optim. Methods Softw., 2021

The minmax regret inverse maximum weight problem.
Appl. Math. Comput., 2021

2020
Computational aspects of the inverse single facility location problem on trees under <i>l</i><sub><i>k</i></sub>-norm.
Theor. Comput. Sci., 2020

A linear time algorithm for the p-maxian problem on trees with distance constraint.
J. Comb. Optim., 2020

The inverse connected p-median problem on block graphs under various cost functions.
Ann. Oper. Res., 2020

2019
Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms.
Theor. Comput. Sci., 2019

A linear time algorithm for balance vertices on trees.
Discret. Optim., 2019

The inverse 1-center problem on cycles with variable edge lengths.
Central Eur. J. Oper. Res., 2019

2018
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks.
Math. Methods Oper. Res., 2018

Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems.
Asia Pac. J. Oper. Res., 2018

2017
Inverse Fractional Knapsack Problem with Profits and Costs Modification.
CoRR, 2017

2016
Inverse 1-Median Problem on Block Graphs with Variable Vertex Weights.
J. Optim. Theory Appl., 2016

The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance.
J. Comb. Optim., 2016

2015
Inverse k-centrum problem on trees with variable vertex weights.
Math. Methods Oper. Res., 2015

The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance.
Eur. J. Oper. Res., 2015

The inverse $p$-maxian problem on trees with variable edge lengths.
CoRR, 2015

Inverse eccentric vertex problem on networks.
Central Eur. J. Oper. Res., 2015

2009
An Information Extraction Approach to English-Vietnamese Weather Bulletins Machine Translation.
Proceedings of the First Asian Conference on Intelligent Information and Database Systems, 2009


  Loading...