Center location problems on tree graphs with subtree-shaped customers

DOI10.1016/J.DAM.2007.11.022MaRDI QIDQ1005232zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Justo Puerto, Arie Tamir, Juan A. Mesa, Dionisio Pérez-Brito

Publication date 9 March 2009

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.11.022

zbMATH Keywords

facility locationtree graphssubtree-shaped customers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Discrete location and assignment (90B80)

Recommendations

• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
• The location of central structures in trees
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• The \(p\)-center problem in tree networks revisited
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees

Cites work

• scientific article; zbMATH DE number 2086252 (Why is no real title available?)
• scientific article; zbMATH DE number 432817 (Why is no real title available?)
• scientific article; zbMATH DE number 1803755 (Why is no real title available?)
• scientific article; zbMATH DE number 9246 (Why is no real title available?)
• scientific article; zbMATH DE number 177536 (Why is no real title available?)
• R -Domination in Graphs
• A recognition algorithm for the intersection graphs of directed paths in directed trees
• A recognition algorithm for the intersection graphs of paths in trees
• A self-stabilizing algorithm which finds a 2-center of a tree
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An Approach to Location Models Involving Sets as Existing Facilities
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• Continuous location of dimensional structures.
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding kth paths and p-centers by generating and searching good data structures
• Finding level-ancestors in trees
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Locating Centers on a Tree with Discontinuous Supply and Demand Regions
• Locating tree-shaped facilities using the ordered median objective
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• New Results on the Complexity of p-Centre Problems
• On computing a longest path in a tree
• One-way and round-trip center location problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Slowing down sorting networks to obtain faster sorting algorithms
• The Round-Trip p-Center and Covering Problem on a Tree
• The minimax multistop location problem on a tree

Cited in

(9)

• Almost self-centered graphs
• The location of central structures in trees
• Embeddings into almost self-centered graphs of given radius
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• A unifying location model on tree graphs based on submodularity property
• The connected p-center problem on block graphs with forbidden vertices
• The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
• On the planar piecewise quadratic 1-center problem
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers

This page was built for publication: Center location problems on tree graphs with subtree-shaped customers

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