An algorithm for finding the absolute center of a network

DOI10.1016/0377-2217(90)90421-7zbMath0738.90046OpenAlexW1983366136MaRDI QIDQ1173797

Aantonio Sforza

Publication date: 25 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90421-7

zbMATH Keywords

weighted networksabsolute center of a networkunweighted networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items (3)

Biobjective center – balance graph location model^* ⋮ Location and layout planning. A survey ⋮ Discrete Center Problems

Cites Work

• Unnamed Item
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• A polynomial time algorithm for finding the absolute center of a network
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: An algorithm for finding the absolute center of a network