The general facility location problem with connectivity on trees

DOI10.1007/S10114-016-4715-0MaRDI QIDQ335115zbMATHOpenAlexFDO

Authors Erfang Shan, Liying 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

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

Recommendations

• Facility location on a tree with maximum distance constraints
• Optimal location of interconnected facilities on tree networks subject to distance constraints
• Distance-constrained multifacility minimax location problems on tree networks
• Two classes of location problems on tree networks
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
• Approximation algorithms for facility location with capacitated and length-bounded tree connections
• Locating Two Facilities on a Tree Subject to Distance Constraints
• Facility location with tree topology and radial distance constraints
• Range minimization problems in path-facility location on trees

Cites work

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

Cited in

(9)

• Optimal location of interconnected facilities on tree networks subject to distance constraints
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract)
• scientific article; zbMATH DE number 7378709 (Why is no real title available?)
• Exploiting Structure: Location Problems on Trees and Treelike Graphs
• The generalized P‐forest problem on a tree network
• On the connectedness property of service areas for the Network Facility Location Problem
• Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
• scientific article; zbMATH DE number 2119651 (Why is no real title available?)

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

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