Polynomially bounded algorithms for locating p-centers on a tree

Abstract

We discuss several forms of the p-center location problems on an undirected tree network. Our approach is based on utilizing results for rigid circuit graphs to obtain polynomial algorithms for solving the model. Duality theory on perfect graphs is used to define and solve the dual location model. © 1982 The Mathematical Programming Society, Inc.