On the Complexity of the Elzinga-hearn Algorithm for the 1-center Problem

Z Drezner; S Shelah

doi:10.1287/moor.12.2.255

On the Complexity of the Elzinga-hearn Algorithm for the 1-center Problem

Z Drezner
, S Shelah

Einstein Institute of Mathematics

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

Original language	English
Pages (from-to)	255-261
Number of pages	7
Journal	Mathematics of Operations Research
Volume	12
Issue number	2
DOIs	https://doi.org/10.1287/moor.12.2.255
State	Published - May 1987

Access to Document

10.1287/moor.12.2.255

Cite this

@article{e7fec4d2a9ee4ae2a95b2efa705cf06f,

title = "On the Complexity of the Elzinga-hearn Algorithm for the 1-center Problem",

author = "Z Drezner and S Shelah",

year = "1987",

month = may,

doi = "10.1287/moor.12.2.255",

language = "אנגלית",

volume = "12",

pages = "255--261",

journal = "Mathematics of Operations Research",

issn = "0364-765X",

publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

number = "2",

}

TY - JOUR

T1 - On the Complexity of the Elzinga-hearn Algorithm for the 1-center Problem

AU - Drezner, Z

AU - Shelah, S

PY - 1987/5

Y1 - 1987/5

UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=starter5-25&SrcAuth=WosAPI&KeyUT=WOS:A1987H433100006&DestLinkType=FullRecord&DestApp=WOS_CPL

U2 - 10.1287/moor.12.2.255

DO - 10.1287/moor.12.2.255

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

SN - 0364-765X

VL - 12

SP - 255

EP - 261

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

IS - 2

ER -

On the Complexity of the Elzinga-hearn Algorithm for the 1-center Problem

Access to Document

Other files and links

Cite this