The connected p-median problem on complete multi-layered graphs

DOI10.1142/S1793830921501184zbMath1490.90189OpenAlexW3134426243MaRDI QIDQ5866016

Tran Hoai Ngoc Nhan, Kien Trung Nguyen, Wen Chean Teh, Nguyen Thanh Hung

Publication date: 10 June 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921501184

zbMATH Keywords

location problemconnected \(p\)-median1-mediancomplete multi-layered graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

A linear time algorithm for connected \(p\)-centdian problem on block graphs

Cites Work

• Unnamed Item
• The connected \(p\)-median problem on block graphs
• The connected \(p\)-center problem on block graphs with forbidden vertices
• Foundations of location analysis
• The \(p\)-maxian problem on block graphs
• Algorithms for connected \(p\)-centdian problem on block graphs
• The inverse connected \(p\)-median problem on block graphs under various cost functions
• The connected \(p\)-center problem on cactus graphs
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians

This page was built for publication: The connected p-median problem on complete multi-layered graphs