The centdian subtree on tree networks

Arie Tamir; Justo Puerto; Dionisio Pérez-Brito

doi:10.1016/S0166-218X(01)00199-8

The centdian subtree on tree networks

Arie Tamir^*, Justo Puerto, Dionisio Pérez-Brito

^*Corresponding author for this work

School of Mathematical Sciences

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

37 Scopus citations

Abstract

This paper describes an O(n log n) algorithm for finding the optimal location of a tree shaped facility of a specified size in a tree network with n nodes, using the centdian criterion: a convex combination of the weighted average distance and the maximum weighted distance from the facility to the demand points (nodes of the tree). These optimization criteria introduced by Halpern, combine the weighted median and weighted center objective functions. Therefore they capture more real-world problems and provide good ways to trade-off minisum (efficiency) and minimax (equity) approaches.

Original language	English
Pages (from-to)	263-278
Number of pages	16
Journal	Discrete Applied Mathematics
Volume	118
Issue number	3
DOIs	https://doi.org/10.1016/S0166-218X(01)00199-8
State	Published - 15 May 2002

Keywords

Location
Networks
Path
Tree

Access to Document

10.1016/S0166-218X(01)00199-8

Cite this

@article{99e932a6980f48f19675ae69c074a8ee,

title = "The centdian subtree on tree networks",

abstract = "This paper describes an O(n log n) algorithm for finding the optimal location of a tree shaped facility of a specified size in a tree network with n nodes, using the centdian criterion: a convex combination of the weighted average distance and the maximum weighted distance from the facility to the demand points (nodes of the tree). These optimization criteria introduced by Halpern, combine the weighted median and weighted center objective functions. Therefore they capture more real-world problems and provide good ways to trade-off minisum (efficiency) and minimax (equity) approaches.",

keywords = "Location, Networks, Path, Tree",

author = "Arie Tamir and Justo Puerto and Dionisio P{\'e}rez-Brito",

year = "2002",

month = may,

day = "15",

doi = "10.1016/S0166-218X(01)00199-8",

language = "אנגלית",

volume = "118",

pages = "263--278",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - The centdian subtree on tree networks

AU - Tamir, Arie

AU - Puerto, Justo

AU - Pérez-Brito, Dionisio

PY - 2002/5/15

Y1 - 2002/5/15

N2 - This paper describes an O(n log n) algorithm for finding the optimal location of a tree shaped facility of a specified size in a tree network with n nodes, using the centdian criterion: a convex combination of the weighted average distance and the maximum weighted distance from the facility to the demand points (nodes of the tree). These optimization criteria introduced by Halpern, combine the weighted median and weighted center objective functions. Therefore they capture more real-world problems and provide good ways to trade-off minisum (efficiency) and minimax (equity) approaches.

AB - This paper describes an O(n log n) algorithm for finding the optimal location of a tree shaped facility of a specified size in a tree network with n nodes, using the centdian criterion: a convex combination of the weighted average distance and the maximum weighted distance from the facility to the demand points (nodes of the tree). These optimization criteria introduced by Halpern, combine the weighted median and weighted center objective functions. Therefore they capture more real-world problems and provide good ways to trade-off minisum (efficiency) and minimax (equity) approaches.

KW - Location

KW - Networks

KW - Path

KW - Tree

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

U2 - 10.1016/S0166-218X(01)00199-8

DO - 10.1016/S0166-218X(01)00199-8

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

AN - SCOPUS:84867936125

SN - 0166-218X

VL - 118

SP - 263

EP - 278

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 3

ER -

The centdian subtree on tree networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this