Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph

The graph median and center problems are well known with numerous possible applications. The first is suitable for locating a facility providing a routine service, by means of minimizing the average distance of customers to it. The second is appropriate for emergency services where the objective is to have the furthest customer as near as possible to the center. In reality a combination of both, usually antagonistic, goals is common. This paper presents a procedure to locate a facility on a graph, such that a convex combination of the median and the center objective functions is minimized. The term “cent-dian” is coined for this point of the graph. Since it is usually difficult to assign precise weights to the two objectives, when they are convexly combined, the procedure generates the cent-dians for all possible combinations. Finally, an equivalent median problem on an expanded graph is presented.

• 저널Management Science · 24(5) · 535–544
• 토픽Facility Location and Emergency Management · Organizational Behavior and Human Resource Management
• DOI10.1287/mnsc.24.5.535
• 저자Jonathan Halpern