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

Jonathan Halpern
Additional contact information
Jonathan Halpern: University of Calgary, Canada

Management Science, 1978, vol. 24, issue 5, 535-544

Abstract: 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.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.5.535 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:24:y:1978:i:5:p:535-544

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().