A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

Nir Halman

doi:10.1016/s0020-0190(02)00489-1

A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

Nir Halman

Tel Aviv University

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

3 Scopus citations

Abstract

An optimal time algorithm, for the weighted lexicographic rectilinear 1-center problem in the plane was presented. The problem arises in the area of facility location in operations research. The problem was treated as a three-dimensional linear programming problem (LP) and thereafter the optimal value of the objective function was calculated.

Original language	English
Pages (from-to)	121-128
Number of pages	8
Journal	Information Processing Letters
Volume	86
Issue number	3
DOIs	https://doi.org/10.1016/s0020-0190(02)00489-1
State	Published - 16 May 2003
Externally published	Yes

Keywords

Algorithms

Access to Document

10.1016/s0020-0190(02)00489-1

Cite this

@article{ad992c5dec494ad4809030de713ba3a8,

title = "A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane",

abstract = "An optimal time algorithm, for the weighted lexicographic rectilinear 1-center problem in the plane was presented. The problem arises in the area of facility location in operations research. The problem was treated as a three-dimensional linear programming problem (LP) and thereafter the optimal value of the objective function was calculated.",

keywords = "Algorithms",

author = "Nir Halman",

year = "2003",

month = may,

day = "16",

doi = "10.1016/s0020-0190(02)00489-1",

language = "אנגלית",

volume = "86",

pages = "121--128",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

AU - Halman, Nir

PY - 2003/5/16

Y1 - 2003/5/16

N2 - An optimal time algorithm, for the weighted lexicographic rectilinear 1-center problem in the plane was presented. The problem arises in the area of facility location in operations research. The problem was treated as a three-dimensional linear programming problem (LP) and thereafter the optimal value of the objective function was calculated.

AB - An optimal time algorithm, for the weighted lexicographic rectilinear 1-center problem in the plane was presented. The problem arises in the area of facility location in operations research. The problem was treated as a three-dimensional linear programming problem (LP) and thereafter the optimal value of the objective function was calculated.

KW - Algorithms

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

U2 - 10.1016/s0020-0190(02)00489-1

DO - 10.1016/s0020-0190(02)00489-1

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

AN - SCOPUS:0037449047

SN - 0020-0190

VL - 86

SP - 121

EP - 128

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this