Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

1964/06/01 by S. L. Hakimi · 18 citations
Engineering · #Advanced Research in Systems and Signal Processing

paper · doi:10.1287/opre.12.3.450

Abstract

The concepts of the “center” and the “median vertex” of a graph are generalized to the “absolute center” and the “absolute median” of a weighted graph (a graph with weights attached to its vertices as well as to its branches). These results are used to find the optimum location of a “switching center” in a communication network and to locate the best place to build a “police station” in a highway system. It is shown that the optimum location of a switching center is always at a vertex of the communication network while the best location for the police station is not necessarily at an intersection. Procedures for finding these locations are given.

Cited by

• The Location of Emergency Service Facilities
• Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems
• Theoretical and Computational Links between the p‐Median, Location Set‐covering, and the Maximal Covering Location Problem
• Structure and temporal evolution of transportation literature
• Optimization approaches to identify cyclists’ route choice criteria
• A Foundational Perspective for Partitional Clustering on Networks
• Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems
• Ordered p-median problems with neighborhoods
• Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution\n Algorithm
• Stochastic Emergency Response Units (ERUs) Allocation Considering\n Secondary Incident Occurrences
• Centrality in social networks conceptual clarification
• Optimizing Administrative Divisions: A Vertex k-Center Approach for Edge-Weighted Road Graphs
• Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming
• Network Centrality and Market Prices: An Empirical Note
• Fast approximation algorithms for the 1-median problem on real-world large graphs
• An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
• Investigating State-of-the-Art Planning Strategies for Electric Vehicle Charging Infrastructures in Coupled Transport and Power Networks: A Comprehensive Review
• Algorithm for Two-Phase Facility Planning via Balanced Clustering and Integer Programming

Related

• Optimal k-centers of a graph: a control-theoretic approach
• Finding the Center and Centroid of a Graph with Multiple Sources
• Optimizing Budget Allocation in Graphs
• On λ-Cent-Dians and Generalized-Center for Network Design: Definitions and Properties
• The problem of optimal location of production points and distribution points in the vertices of the transportation network as an investment project