Location on tree networks: the medi-center

• Main Author: Olaivar, Thelma D.
• Format: text
• Language: English
• Published: Animo Repository 1997
• Subjects: Trees (Graph theory); Mathematical optimization; Network analysis (Planning); Algorithms; Mathematics
• Online Access: https://animorepository.dlsu.edu.ph/etd_masteral/1805
• Institution: De La Salle University

This thesis is an exposition on the article of Gabriel Y. Handler entitled The Medi - Centers of a Tree . It is a detailed study on the constraint approach to the medi-center problem of a tree which is used if the goals for facility location is minimize average distance subject to the constraint that the distance of the farthest vertex is no more than y units away . Such goal can be mathematically formulated as:minx e T Eyen w(y) d(x,y)subject to e(x) = max yeN d(x,y) less than or equal to y where T is any T = (N,A) and the optimal solution to the problem is called the absolute medi-center. In particular, this paper aims to a) explain in greater detail how the absolute medi-center and the vertex medi-center can be solved by means of algorithms b) justify the existence of efficient algorithms for the medi-center problem and c) justify the existence of efficient algorithms for the median and the center of a tree which are used to solve the medi-center problem.