The general facility location problem with connectivity on trees

DOI10.1007/s10114-016-4715-0zbMath1348.05206OpenAlexW2517566148MaRDI QIDQ335115

Erfang Shan, Li-ying Kang

Publication date: 2 November 2016

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-016-4715-0

zbMATH Keywords

treeconnected \(p\)-medianconnected \(p\)-centerequivalent binary tree

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• The connected \(p\)-center problem on block graphs with forbidden vertices
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• The distance-domination numbers of trees
• Improved complexity bounds for location problems on the real line
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• An Overview of Representative Problems in Location Research
• Combinatorial Optimization with Rational Objective Functions
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: The general facility location problem with connectivity on trees