Polynomially bounded algorithms for locating p-centers on a tree

R. Chandrasekaran*, A. Tamir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)304-315
Number of pages12
JournalMathematical Programming
Volume22
Issue number1
DOIs
StatePublished - Dec 1982

Keywords

  • Location Theory
  • Polynomial Algorithms
  • Rigid Circuit Graphs
  • Tree Networks

Fingerprint

Dive into the research topics of 'Polynomially bounded algorithms for locating p-centers on a tree'. Together they form a unique fingerprint.

Cite this