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 . For the first problem, we develop a combinatorial 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 , we propose an algorithm based on the optimality criterion, where n is the number of existing points.
Acknowledgements
The authors would like acknowledge the anonymous referees for valuable suggestions which help to improve this paper significantly.
Disclosure statement
No potential conflict of interest was reported by the authors.
ORCID
Kien Trung Nguyen http://orcid.org/0000-0002-7522-4557