Abstract
The general location problem in a network is to find locations of facilities in a given network such that the total cost is minimum. It is very often to have its reverse case, in which the facilities have already been located on the network, and the problem is how to improve the network within a given budget so that the improved network is as efficient as possible. In this paper we present a strongly polynomial algorithm for a reverse location problem in tree networks. The method can be extended to solve reverse two- or more-location problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
