Abstract
This paper is concerned with a reverse obnoxious (undesirable) center location problem on networks in which the aim is to modify the edge lengths within an associated budget such that a predetermined facility location on the underlying network becomes as far as possible from the existing customer points under the new edge lengths. Exact combinatorial algorithms with linear time complexities are developed for the problem under the weighted rectilinear norm and the weighted Hamming distance. Furthermore, it is shown that the problem with integer decision variables can also be solved in linear time.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
