Polynomially bounded algorithms for locatingp-centers on a tree |
| |
| Authors: | R. Chandrasekaran A. Tamir |
| |
| Affiliation: | (1) The University of Texas at Dallas, Richardson, TX, USA;(2) Tel-Aviv University, Tel-Aviv, Israel |
| |
| Abstract: | We discuss several forms of thep-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. |
| |
| Keywords: | Location Theory Tree Networks Rigid Circuit Graphs Polynomial Algorithms |
| 本文献已被 SpringerLink 等数据库收录！ |
