Abstract
In a cardinality constrained inverse center location problem on networks, the goal is to modify the edge lengths at the minimum total cost subject to the given modification bounds so that a prespecified vertex becomes an absolute center location of the underlying network under the perturbed edge lengths and further the cardinality of the modified edge lengths obeys an upper bound. Using a set of self-constructed red-black search trees, as a suitable data structure, we propose novel optimal algorithms with polynomial time complexities for the problem on tree networks under various cost norms.
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.
