Locating A Median Subtree On A Network

DOI10.1080/03155986.1991.11732163MaRDI QIDQ3359989zbMATH OpenOpenAlexFDO

Authors Tae Ung Kim, Timothy J. Lowe, James E. Ward

Publication date 1991

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1991.11732163

zbMATH Keywords

linear time algorithmcentral facilityconnected, unidirected network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 961964
• A minimum-length covering subtree of a tree
• Medi-Centers of a Tree
• A minimum length covering subgraph of a network
• The centdian subtree on tree networks

Cited in

(24)

• Locating facilities which interact: Some solvable cases
• The centdian subtree on tree networks
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• On Parametric Medians of Trees
• A minimum length covering subgraph of a network
• Locating tree-shaped facilities using the ordered median objective
• The location of central structures in trees
• Medi-Centers of a Tree
• scientific article; zbMATH DE number 1484050 (Why is no real title available?)
• Best location of service centers in a treelike network under budget constraints
• Bi-objective median subtree location problems
• scientific article; zbMATH DE number 3854768 (Why is no real title available?)
• scientific article; zbMATH DE number 4051314 (Why is no real title available?)
• From the median to the generalized center
• scientific article; zbMATH DE number 3950165 (Why is no real title available?)
• A review of extensive facility location in networks
• Solving Nonlinear Single-Facility Network Location Problems
• The minisum location problem on an undirected network with continuous link demands
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• The extensive 1-median problem with radius on networks
• Locating median paths on connected outerplanar graphs
• Finding the conditional location of a median path on a tree
• Locating median cycles in networks
• Locating the median of a tree in real time

This page was built for publication: Locating A Median Subtree On A Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359989)