default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKien Trung Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j23]Huong Nguyen-Thu, Kien Trung Nguyen
, Nguyen Thanh Toan:
The max-sum inverse median location problem on trees with budget constraint. Appl. Math. Comput. 460: 128296 (2024)- [j22]Kien Trung Nguyen, Le Huy Minh:
An integrated approach for allocation and scheduling-location problems on graphs. Comput. Appl. Math. 43(3): 147 (2024) - [j21]Le Xuan Dai, Kien Trung Nguyen, Le Phuong Thao, Pham Thi Vui:
Some robust inverse median problems on trees with interval costs. Comput. Manag. Sci. 21(2): 42 (2024) - 2023
- [j20]Tran Hoai Ngoc Nhan, Kien Trung Nguyen, Huong Nguyen-Thu:
The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights. Asia Pac. J. Oper. Res. 40(3): 2250033:1-2250033:17 (2023) - 2022
- [j19]Kien Trung Nguyen, Tran Hoai Ngoc Nhan, Wen Chean Teh, Nguyen Thanh Hung:
The connected p-median problem on complete multi-layered graphs. Discret. Math. Algorithms Appl. 14(3): 2150118:1-2150118:13 (2022) - [j18]Kien Trung Nguyen, Wen Chean Teh, Nguyen Thanh Hung, Huong Nguyen-Thu:
A linear time algorithm for connected p-centdian problem on block graphs. Theor. Comput. Sci. 923: 318-326 (2022) - 2021
- [j17]Kien Trung Nguyen, Nguyen Thanh Hung:
The minmax regret inverse maximum weight problem. Appl. Math. Comput. 407: 126328 (2021) - [j16]Van-Huy Pham, Kien Trung Nguyen, Tran Thu Le:
Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance. Optim. Methods Softw. 36(4): 755-772 (2021) - [j15]Lam Quoc Anh, Nguyen Xuan Hai, Kien Trung Nguyen, Nguyen Hong Quan, Dang Thi My Van:
On the existence and stability of solutions to stochastic equilibrium problems. RAIRO Oper. Res. 55(Supplement): S705-S718 (2021) - [j14]Wen Chean Teh, Kien Trung Nguyen, Chuei Yee Chen:
Ranks of strictly minimal reaction systems induced by permutations. Theor. Comput. Sci. 872: 1-14 (2021) - 2020
- [j13]Kien Trung Nguyen, Nguyen Thanh Hung:
The inverse connected p-median problem on block graphs under various cost functions. Ann. Oper. Res. 292(1): 97-112 (2020) - [j12]Kien Trung Nguyen, Nguyen Thanh Hung, Huong Nguyen-Thu:
A linear time algorithm for the p-maxian problem on trees with distance constraint. J. Comb. Optim. 40(4): 1030-1043 (2020) - [j11]Le Huynh My Van, Kien Trung Nguyen, Nguyen Thanh Hung:
Computational aspects of the inverse single facility location problem on trees under lk-norm. Theor. Comput. Sci. 844: 133-141 (2020) - 2019
- [j10]Kien Trung Nguyen:
The inverse 1-center problem on cycles with variable edge lengths. Central Eur. J. Oper. Res. 27(1): 263-274 (2019) - [j9]Van Huy Pham, Kien Trung Nguyen, Tran Thu Le:
A linear time algorithm for balance vertices on trees. Discret. Optim. 32: 37-42 (2019) - [j8]Van Huy Pham, Kien Trung Nguyen:
Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms. Theor. Comput. Sci. 795: 119-127 (2019) - 2018
- [j7]Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab, Kien Trung Nguyen:
Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems. Asia Pac. J. Oper. Res. 35(5): 1850030:1-1850030:22 (2018) - [j6]Kien Trung Nguyen, Huong Nguyen-Thu, Nguyen Thanh Hung:
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks. Math. Methods Oper. Res. 88(2): 147-159 (2018) - 2016
- [j5]Kien Trung Nguyen, Ali Reza Sepasian:
The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance. J. Comb. Optim. 32(3): 872-884 (2016) - [j4]Kien Trung Nguyen:
Inverse 1-Median Problem on Block Graphs with Variable Vertex Weights. J. Optim. Theory Appl. 168(3): 944-957 (2016) - 2015
- [j3]Kien Trung Nguyen, André B. Chassein:
Inverse eccentric vertex problem on networks. Central Eur. J. Oper. Res. 23(3): 687-698 (2015) - [j2]Kien Trung Nguyen, André B. Chassein:
The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance. Eur. J. Oper. Res. 247(3): 774-781 (2015) - [j1]Kien Trung Nguyen, Lam Quoc Anh:
Inverse k-centrum problem on trees with variable vertex weights. Math. Methods Oper. Res. 82(1): 19-30 (2015)
Conference and Workshop Papers
- 2009
- [c1]Son Bao Pham, Giang Binh Tran, Dang Duc Pham, Kien Chi Phung, Kien Trung Nguyen:
An Information Extraction Approach to English-Vietnamese Weather Bulletins Machine Translation. ACIIDS 2009: 161-166
Informal and Other Publications
- 2017
- [i2]Kien Trung Nguyen, Huynh Duc Quoc:
Inverse Fractional Knapsack Problem with Profits and Costs Modification. CoRR abs/1704.00145 (2017) - 2015
- [i1]Kien Trung Nguyen:
The inverse $p$-maxian problem on trees with variable edge lengths. CoRR abs/1504.02830 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-01 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
