{"id":"https://openalex.org/W428790488","doi":null,"title":"EFFICIENT ALGORITHM FOR LOCATING A NEW TRANSPORTATION FACILITY IN A NETWORK","display_name":"EFFICIENT ALGORITHM FOR LOCATING A NEW TRANSPORTATION FACILITY IN A NETWORK","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W428790488","mag":"428790488"},"language":"en","primary_location":{"id":"mag:428790488","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/309108","pdf_url":null,"source":{"id":"https://openalex.org/S145575934","display_name":"Transportation Research Record Journal of the Transportation Research Board","issn_l":"0361-1981","issn":["0361-1981","2169-4052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Transportation Research Record Journal of the Transportation Research Board","raw_type":null},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022913385","display_name":"Huel-sheng Tsay","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huel-sheng Tsay","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019039433","display_name":"Liang\u2010Tay Lin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liang\u2010Tay Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3650,"currency":"USD","value_usd":3650},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09231742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":"1251","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.8759999871253967},{"id":"https://openalex.org/keywords/transportation-networks","display_name":"transportation networks","score":0.5730000138282776},{"id":"https://openalex.org/keywords/spanning-trees","display_name":"spanning trees","score":0.8519999980926514},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"minimum distance","score":0.5569999814033508},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7770000100135803}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7047867178916931},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6062471270561218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5823637247085571},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5488548278808594},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.5351064801216125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5303801894187927},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4809243381023407},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.41818147897720337},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3885403275489807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2991430163383484},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.17659875750541687},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1682569980621338},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15300878882408142},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09570303559303284},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:428790488","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/309108","pdf_url":null,"source":{"id":"https://openalex.org/S145575934","display_name":"Transportation Research Record Journal of the Transportation Research Board","issn_l":"0361-1981","issn":["0361-1981","2169-4052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Transportation Research Record Journal of the Transportation Research Board","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5378999710083008,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"},{"score":0.5142999887466431,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2007808878","https://openalex.org/W1972850002","https://openalex.org/W2171350309","https://openalex.org/W1590601234","https://openalex.org/W2170271059","https://openalex.org/W1481293165","https://openalex.org/W2136255350","https://openalex.org/W2159541789","https://openalex.org/W6979810684","https://openalex.org/W2913310433"],"abstract_inverted_index":{"The":[0,31,134,181,221],"single-location":[1,29],"problem":[2,34,272],"is":[3,35,125,139,157,170,190,232,273],"to":[4,93,106,128,148,159,177,186,193,249],"locate":[5],"a":[6,11,56,59,91,104,118,122,150,154,166,207,265,276],"new":[7,119,155,226,230,259,266],"transportation":[8],"facility":[9,267],"in":[10,37,42,191,236,275],"network":[12,92],"that":[13,43,169,173,224],"can":[14],"serve":[15],"all":[16,87,178],"customers":[17,46],"at":[18],"the":[19,45,52,71,75,81,95,108,130,145,161,175,188,194,225,229,238,244,258,269],"minimum":[20],"distance":[21],"or":[22,58,228,261],"cost.":[23],"There":[24,64],"are":[25,47,65],"four":[26,210],"types":[27],"of":[28,90,110,174,183,196,199,257],"problems.":[30],"absolute":[32,72,131,162,239,270],"1-center":[33,132,163,240,271],"considered":[36,86,274],"this":[38,116],"paper.":[39],"By":[40],"definition,":[41],"problem,":[44],"on":[48,61,165],"any":[49,202],"vertex":[50,57,176],"and":[51,79,101,136,142,216,234,247],"center":[53],"may":[54],"be":[55],"point":[60],"an":[62],"edge.":[63],"two":[66],"previous":[67],"methods":[68,212],"for":[69,113,201,263],"finding":[70,237],"1-center:":[73],"(a)":[74],"Hakimi":[76],"method":[77,83,147,156,227,260],"(1965)":[78],"(b)":[80],"Minieka":[82,146],"(1981).":[84],"They":[85,242],"possible":[88],"links":[89,111],"determine":[94],"best":[96],"candidate":[97],"point.":[98],"Later,":[99],"Larson":[100,135],"Odoni":[102,137],"proposed":[103,127],"shortcut":[105,120,138,231,262],"reduce":[107],"number":[109,182,195],"needed":[112,185],"calculation.":[114],"In":[115],"paper,":[117],"with":[121,144,218],"stricter":[123],"bound":[124],"first":[126],"find":[129,160],"directly.":[133],"then":[140],"introduced":[141],"integrated":[143],"form":[149],"combined":[151],"method.":[152],"Finally,":[153],"developed":[158],"based":[164],"spanning":[167],"tree":[168],"obtained":[171],"from":[172],"shortest":[179],"distances.":[180],"iterations":[184],"perform":[187],"analysis":[189],"proportion":[192],"vertices":[197],"instead":[198],"edges":[200],"given":[203],"network.":[204,277],"To":[205],"make":[206],"consistent":[208],"comparison":[209],"different":[211],"have":[213],"been":[214],"programmed":[215],"tested":[217],"several":[219],"networks.":[220],"results":[222],"show":[223],"fast":[233],"powerful":[235],"location.":[241],"provide":[243],"same":[245],"solutions":[246],"belong":[248],"polynomial":[250],"time-bounded":[251],"algorithms.":[252],"Therefore,":[253],"we":[254],"recommend":[255],"use":[256],"locating":[264],"if":[268]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2016-06-24T00:00:00"}