The continuous center set of a network

DOI10.1016/0166-218X(91)90043-VzbMath0722.90038OpenAlexW1974862709MaRDI QIDQ757234

Brigitte Nicolas, Martine Labbé, Pierre Hansen

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90043-v

zbMATH Keywords

local continuous centerundirected connected network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Shortcut sets for plane Euclidean networks (extended abstract) ⋮ Computing optimal shortcuts for networks ⋮ Unnamed Item ⋮ Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks ⋮ Shortcut sets for the locus of plane Euclidean networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Minisum and Minimax Location Problems Revisited
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• The Centers and Medians of a Graph
• The generalized diameter of a graph
• Letter to the Editor—A Note on a Graph Theoretic Game of Hakimi's
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: The continuous center set of a network