The location of central structures in trees

DOI10.1016/0305-0548(88)90003-2zbMath0635.90026OpenAlexW2048880266MaRDI QIDQ1097827

Timothy J. Lowe, Thomas L. Morin, Rex K. Kincaid

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90003-2

zbMATH Keywords

linear time algorithmspath center locationsubtree locationunweighted vertex case

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items

Comments on: ``Extensive facility location problems on networks: an updated review, A minimum length covering subgraph of a network, Approximating the tree and tour covers of a graph, The path-variance problem on tree networks, A review of extensive facility location in networks, Efficient solution methods for covering tree problems, Location of paths on trees with minimal eccentricity and superior section, A unifying location model on tree graphs based on submodularity property

Cites Work

• Unnamed Item
• Unnamed Item
• Locating an absolute center on graphs that are almost trees
• Parallel concepts in graph theory
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• The optimal location of a path or tree in a tree network
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• Minimax location problems with nonlinear costs
• Distance Constraints for Tree Network Multifacility Location Problems
• A note on a nonlinear minimax location problem in tree networks