Pendant-medians

DOI10.1016/0167-6377(83)90015-9zbMATH Open0521.90047OpenAlexW2913222227MaRDI QIDQ1055337FDOQ1055337

Authors: Edward Minieka 

Publication date: 1983

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(83)90015-9

zbMATH Keywords

logisticsshortest pathtree networkfacility locationsmedian of a networkpendant-medianshortest distance spanning tree

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Inventory, storage, reservoirs (90B05)

Cites Work

• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Title not available (Why is that?)
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Centers to centroids in graphs
• The Centers and Medians of a Graph
• Thek-nucleus of a graph

Cited In (1)

• Group centre and group median of a tree

This page was built for publication: Pendant-medians

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