Abstract
The problem of locating an undesirable facility on a network under the anti-cent-dian criterion is addressed. Such criterion represents the convex combination of the undesirable center (maximize the minimum distance) and the undesirable median (maximize the sum of distances). To determine the optimal location point, we propose an efficient algorithm in O( mn) which improves a former approach proposed by other authors in O( mn log n) time. This new algorithm is based on a new upper bound and on some specific properties of the anti-cent-dian problem.
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.
