Abstract
ABSTRACT Given a network as well as a prescribed vertex s in which a facility is located, the aim of solving reverse 1-centre problems is to decrease edge lengths under a budget constraint in a way that the maximum distance between s and the other vertices is minimized. This paper considers the reverse 1-centre problem on general tree networks with weights associated to vertices under a convex piecewise-linear cost function. It is shown that the problem can be transformed into a parametric minimum cost flow problem. A polynomial time approximation scheme (PTAS) is first developed using the bisection method. Then, the problem on unweighted trees is investigated. Using sensitivity analysis, a pseudo-polynomial time algorithm is designed. Finally, a hybrid algorithm is developed to obtain an exact solution in polynomial time.
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.
