A finite algorithm for the continuous p-center location problem on a graph

Arie Tamir

doi:10.1007/BF02591951

A finite algorithm for the continuous p-center location problem on a graph

Arie Tamir^*

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

Let G=(V,E) be an undirected graph with positive integer edge lengths. Let m be the number of edges in E, and let d be the sum of the edge lengths. We prove that the solution value to the continuous p-center location problem is a rational p₁/p₂, where log p₁=O(m⁵ log d+m⁶ log p), i=1,2. This result is then used to construct a finite algorithm for the continuous p-center problem.

Original language	English
Pages (from-to)	298-306
Number of pages	9
Journal	Mathematical Programming
Volume	31
Issue number	3
DOIs	https://doi.org/10.1007/BF02591951
State	Published - Oct 1985

Keywords

Finite Algorithms
Location Theory
p-Center Problems

Access to Document

10.1007/BF02591951

Cite this

@article{6c6bbe4bd1894189818fc04959707fdb,

title = "A finite algorithm for the continuous p-center location problem on a graph",

abstract = "Let G=(V,E) be an undirected graph with positive integer edge lengths. Let m be the number of edges in E, and let d be the sum of the edge lengths. We prove that the solution value to the continuous p-center location problem is a rational p1/p2, where log p1=O(m5 log d+m6 log p), i=1,2. This result is then used to construct a finite algorithm for the continuous p-center problem.",

keywords = "Finite Algorithms, Location Theory, p-Center Problems",

author = "Arie Tamir",

year = "1985",

month = oct,

doi = "10.1007/BF02591951",

language = "אנגלית",

volume = "31",

pages = "298--306",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "3",

}

TY - JOUR

T1 - A finite algorithm for the continuous p-center location problem on a graph

AU - Tamir, Arie

PY - 1985/10

Y1 - 1985/10

N2 - Let G=(V,E) be an undirected graph with positive integer edge lengths. Let m be the number of edges in E, and let d be the sum of the edge lengths. We prove that the solution value to the continuous p-center location problem is a rational p1/p2, where log p1=O(m5 log d+m6 log p), i=1,2. This result is then used to construct a finite algorithm for the continuous p-center problem.

AB - Let G=(V,E) be an undirected graph with positive integer edge lengths. Let m be the number of edges in E, and let d be the sum of the edge lengths. We prove that the solution value to the continuous p-center location problem is a rational p1/p2, where log p1=O(m5 log d+m6 log p), i=1,2. This result is then used to construct a finite algorithm for the continuous p-center problem.

KW - Finite Algorithms

KW - Location Theory

KW - p-Center Problems

UR - http://www.scopus.com/inward/record.url?scp=0022026597&partnerID=8YFLogxK

U2 - 10.1007/BF02591951

DO - 10.1007/BF02591951

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0022026597

SN - 0025-5610

VL - 31

SP - 298

EP - 306

JO - Mathematical Programming

JF - Mathematical Programming

IS - 3

ER -

A finite algorithm for the continuous p-center location problem on a graph

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this