On a tree‐shaped facility location problem of Minieka

Ramon Rabinovitch; Arie Tamir

doi:10.1002/net.3230220602

On a tree‐shaped facility location problem of Minieka

Ramon Rabinovitch^*, Arie Tamir

^*Corresponding author for this work

School of Mathematical Sciences

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

8 Scopus citations

Abstract

Minieka and Hakimi et al. considered the problem of locating a tree‐shaped facility of a given length in a tree network, with the objective of maximizing the sum of node distances from this facility. They stated the complexity of the model as an open problem. We prove that it is NP‐complete and provide a pseudopolynomial time algorithm.

Original language	English
Pages (from-to)	515-522
Number of pages	8
Journal	Networks
Volume	22
Issue number	6
DOIs	https://doi.org/10.1002/net.3230220602
State	Published - Oct 1992

Access to Document

10.1002/net.3230220602

Cite this

@article{23badffe8783434e9dbc493ee6e5882c,

title = "On a tree‐shaped facility location problem of Minieka",

abstract = "Minieka and Hakimi et al. considered the problem of locating a tree‐shaped facility of a given length in a tree network, with the objective of maximizing the sum of node distances from this facility. They stated the complexity of the model as an open problem. We prove that it is NP‐complete and provide a pseudopolynomial time algorithm.",

author = "Ramon Rabinovitch and Arie Tamir",

year = "1992",

month = oct,

doi = "10.1002/net.3230220602",

language = "אנגלית",

volume = "22",

pages = "515--522",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

number = "6",

}

TY - JOUR

T1 - On a tree‐shaped facility location problem of Minieka

AU - Rabinovitch, Ramon

AU - Tamir, Arie

PY - 1992/10

Y1 - 1992/10

N2 - Minieka and Hakimi et al. considered the problem of locating a tree‐shaped facility of a given length in a tree network, with the objective of maximizing the sum of node distances from this facility. They stated the complexity of the model as an open problem. We prove that it is NP‐complete and provide a pseudopolynomial time algorithm.

AB - Minieka and Hakimi et al. considered the problem of locating a tree‐shaped facility of a given length in a tree network, with the objective of maximizing the sum of node distances from this facility. They stated the complexity of the model as an open problem. We prove that it is NP‐complete and provide a pseudopolynomial time algorithm.

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

U2 - 10.1002/net.3230220602

DO - 10.1002/net.3230220602

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

AN - SCOPUS:0040111901

SN - 0028-3045

VL - 22

SP - 515

EP - 522

JO - Networks

JF - Networks

IS - 6

ER -

On a tree‐shaped facility location problem of Minieka

Abstract

Access to Document

Other files and links

Fingerprint

Cite this