Group centre and group median of a tree

DOI10.1016/0377-2217(93)90119-8zbMath0779.90056OpenAlexW2060465194MaRDI QIDQ1804070

Abraham P. Punnen, S. K. Gupta

Publication date: 29 June 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90119-8

zbMATH Keywords

treenetworkslocationpolynomial time algorithmsgroup centregroup median

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items

The max-sum inverse median location problem on trees with budget constraint ⋮ Inverse group 1-median problem on trees ⋮ Efficient algorithms for two generalized 2-median problems and the group median problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• k-Eccentricity and absolute k-centrum of a probabilistic tree
• Pendant-medians
• Group centre and group median of a network
• Minimum perfect bipartite matchings and spanning trees under categorization
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Properties of thek-centra in a tree network
• The optimal location of a path or tree in a tree network
• Medi-Centers of a Tree
• Centers to centroids in graphs
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• On Locating a Facility to Service Areas within a Network
• Convex Location Problems on Tree Networks
• The Centers and Medians of a Graph