A spanning tree approach to the absolute p-center problem

Date

1998

Authors

Bozkaya, B.
Tansel, B.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
4
views
21
downloads

Citation Stats

Series

Abstract

We consider the absolute p-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. We first prove that every connected network possesses a spanning tree whose p-center solution is also a solution for the network under consideration. Then we propose two classes of spanning trees that are shortest path trees rooted at certain points of the network. We give an experimental study, based on 1440 instances, to test how often these classes of trees include an optimizing tree. We report our computational results on the performance of both types of trees. © 1999 Elsevier Science Ltd. All rights reserved.

Source Title

Location Science

Publisher

Elsevier

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English