Exploiting Structure: Location Problems on Trees and Treelike Graphs

DOI10.1007/978-1-4419-7572-0_14MaRDI QIDQ5506729zbMATH OpenOpenAlexFDO

Authors Rex K. Kincaid

Publication date 16 December 2016

Published in International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4419-7572-0_14

Mathematics Subject Classification ID

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

Recommendations

• Two classes of location problems on tree networks
• Location routing problems on trees
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• An axiomatic characterization of a class of locations in tree networks
• scientific article; zbMATH DE number 1484050
• On locating path- or tree-shaped facilities on networks
• The general facility location problem with connectivity on trees
• scientific article; zbMATH DE number 1264405
• scientific article; zbMATH DE number 3960894
• The tree of hubs location problem

Cites work

• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Extended Theorem for Location on a Network
• An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
• Block-vertex duality and the one-median problem
• Depth-First Search and Linear Graph Algorithms
• Efficient algorithms for center problems in cactus networks
• Finding kth paths and p-centers by generating and searching good data structures
• Finite Dominating Sets for Network Location Problems
• Locating a Point of Minimum Variance on Triangular Graphs
• Locating an absolute center on graphs that are almost trees
• Median problems on wheels and cactus graphs
• On locating new facilities in a competitive environment
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• Some Basic Definitions in Graph Theory
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• The obnoxious center problem on weighted cactus graphs.

Cited in

(3)

• A unifying location model on tree graphs based on submodularity property
• Sequential competitive location on networks
• Slicing tree's geometric potential: an indicator for layout problems based on slicing tree structure

This page was built for publication: Exploiting Structure: Location Problems on Trees and Treelike Graphs

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