Medi-Centers of a Tree

Gabriel Y. Handler
Additional contact information
Gabriel Y. Handler: Tel Aviv University, Tel Aviv, Israel

Transportation Science, 1985, vol. 19, issue 3, 246-260

Abstract: While relatively efficient algorithms are now available for minisum (“median”) and minimax (“center”) network location problems, little attention has been focused on the often realistic cases where both criteria are combined in a single formulation. This paper presents a contribution to the study of such “medi-center” problems. Efficient algorithms are developed for locating a single facility on a tree. The simplicity and efficiency of the algorithms are due to a fundamental convexity property of tree networks.

Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.19.3.246 (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:ortrsc:v:19:y:1985:i:3:p:246-260

Access Statistics for this article

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