The generalized \(p\)-centdian on network

DOI10.1007/BF02628558zbMath0977.68003MaRDI QIDQ5937142

Dionisio Perez-Britos, José A. Moreno Pérez

Publication date: 17 January 2002

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

networks\(\lambda\)-centdianlocation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85) Discrete mathematics in relation to computer science (68R99)

Related Items (7)

An exact procedure and LP formulations for the leader-follower location problem ⋮ A linear time algorithm for connected \(p\)-centdian problem on block graphs ⋮ Approximability results for the $p$-centdian and the converse centdian problems ⋮ Multiple voting location problems ⋮ Range minimization problems in path-facility location on trees ⋮ The continuous and discrete path‐variance problems on trees ⋮ Extensive facility location problems on networks with equity measures

Cites Work

• A correction to the definition of local center
• Duality in the Cent-Dian of a Graph
• Finite Dominating Sets for Network Location Problems
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• A polynomial algorithm for thep-centdian problem on a tree
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: The generalized \(p\)-centdian on network