@article{doi:10.1080/02331934.2019.1571056,
	title = {On some inverse 1-center location problems},
	volume = {68},
	issn = {10294945},
	url = {https://doi.org/10.1080/02331934.2019.1571056},
	doi = {10.1080/02331934.2019.1571056},
	abstract = {This paper addresses two problems, the inverse 1-center problem on the line with closed-interval facilities and the inverse 1-center problem on Rd. For the first problem, we develop a combinatorial O(n log n) algorithm based on the convexity of the objective function, where n is the number of facilities. We also discuss the corresponding problem on interval graphs with the similar solution approach. Concerning the inverse 1-center problem on Rd, we propose an O(dn2 log n) algorithm based on the optimality criterion, where n is the number of existing points.},
	number = {5},
	journal = {Optimization},
	author = {Nguyen, Kien Trung and Hung, Nguyen Thanh and Nguyen-Thu, Huong and Le, Tran Thu and Pham, Van Huy},
	year = {2019},
	note = {Publisher: Taylor \& Francis},
	keywords = {1-center, Location problem, interval graph, inverse optimization},
	pages = {999--1015},
}

{"_id":"PhuytcqPbMp4BB8od","bibbaseid":"nguyen-hung-nguyenthu-le-pham-onsomeinverse1centerlocationproblems-2019","author_short":["Nguyen, K. T.","Hung, N. T.","Nguyen-Thu, H.","Le, T. T.","Pham, V. H."],"bibdata":{"bibtype":"article","type":"article","title":"On some inverse 1-center location problems","volume":"68","issn":"10294945","url":"https://doi.org/10.1080/02331934.2019.1571056","doi":"10.1080/02331934.2019.1571056","abstract":"This paper addresses two problems, the inverse 1-center problem on the line with closed-interval facilities and the inverse 1-center problem on Rd. For the first problem, we develop a combinatorial O(n log n) algorithm based on the convexity of the objective function, where n is the number of facilities. We also discuss the corresponding problem on interval graphs with the similar solution approach. Concerning the inverse 1-center problem on Rd, we propose an O(dn2 log n) algorithm based on the optimality criterion, where n is the number of existing points.","number":"5","journal":"Optimization","author":[{"propositions":[],"lastnames":["Nguyen"],"firstnames":["Kien","Trung"],"suffixes":[]},{"propositions":[],"lastnames":["Hung"],"firstnames":["Nguyen","Thanh"],"suffixes":[]},{"propositions":[],"lastnames":["Nguyen-Thu"],"firstnames":["Huong"],"suffixes":[]},{"propositions":[],"lastnames":["Le"],"firstnames":["Tran","Thu"],"suffixes":[]},{"propositions":[],"lastnames":["Pham"],"firstnames":["Van","Huy"],"suffixes":[]}],"year":"2019","note":"Publisher: Taylor & Francis","keywords":"1-center, Location problem, interval graph, inverse optimization","pages":"999–1015","bibtex":"@article{doi:10.1080/02331934.2019.1571056,\n\ttitle = {On some inverse 1-center location problems},\n\tvolume = {68},\n\tissn = {10294945},\n\turl = {https://doi.org/10.1080/02331934.2019.1571056},\n\tdoi = {10.1080/02331934.2019.1571056},\n\tabstract = {This paper addresses two problems, the inverse 1-center problem on the line with closed-interval facilities and the inverse 1-center problem on Rd. For the first problem, we develop a combinatorial O(n log n) algorithm based on the convexity of the objective function, where n is the number of facilities. We also discuss the corresponding problem on interval graphs with the similar solution approach. Concerning the inverse 1-center problem on Rd, we propose an O(dn2 log n) algorithm based on the optimality criterion, where n is the number of existing points.},\n\tnumber = {5},\n\tjournal = {Optimization},\n\tauthor = {Nguyen, Kien Trung and Hung, Nguyen Thanh and Nguyen-Thu, Huong and Le, Tran Thu and Pham, Van Huy},\n\tyear = {2019},\n\tnote = {Publisher: Taylor \\& Francis},\n\tkeywords = {1-center, Location problem, interval graph, inverse optimization},\n\tpages = {999--1015},\n}\n\n","author_short":["Nguyen, K. T.","Hung, N. T.","Nguyen-Thu, H.","Le, T. T.","Pham, V. H."],"key":"doi:10.1080/02331934.2019.1571056","id":"doi:10.1080/02331934.2019.1571056","bibbaseid":"nguyen-hung-nguyenthu-le-pham-onsomeinverse1centerlocationproblems-2019","role":"author","urls":{"Paper":"https://doi.org/10.1080/02331934.2019.1571056"},"keyword":["1-center","Location problem","interval graph","inverse optimization"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://api.zotero.org/groups/2168152/items?key=VCdsaROd5deDY3prqqG8kI0c&format=bibtex&limit=100","dataSources":["syJjwTDDM32TsM2iF","QwrFbRJvXF69SEShv","HbngRCZLbLed2q9QT","LtEFvT85hYpNg4Esp","iHfnnAr7wKJJxkNMt","PrvBTxn4Zgeep29e5","78Yd9ZHcx783Wkffe","SKRhTA7ok4L4waPkZ","GfrMfnKTkYdcYTRsy","RqqCdXGEyWH4dZ76k","cbiwaQPQJSZeJDDY9","2Jak7xK39ytqcgqQ4","CDfDBPD6CDScj6Ty4","WgiCycoQjRx6KArBy","KBdipwowTNXWiKqYd","yjd6eECyb3TYZpZ3R","D9jmZ7aoHfJnYQ4ES","R8dLFAvyQ2oFRijDJ","dc6SzEK4S9LfC3XpA","kGWABmrDfhF29uibh","YE9GesxGLCsBc3vvC","v3qfuosZ66nvD85FK","BSxBG5ms26R2teZn9"],"keywords":["1-center","location problem","interval graph","inverse optimization"],"search_terms":["inverse","center","location","problems","nguyen","hung","nguyen-thu","le","pham"],"title":"On some inverse 1-center location problems","year":2019}