{"id":"https://openalex.org/W2120218603","doi":"https://doi.org/10.1080/10637199408915406","title":"THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK","display_name":"THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2120218603","doi":"https://doi.org/10.1080/10637199408915406","mag":"2120218603"},"language":"en","primary_location":{"id":"doi:10.1080/10637199408915406","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915406","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5109044666","display_name":"Shietung Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I141591182","display_name":"University of Aizu","ror":"https://ror.org/02pg0e883","country_code":"JP","type":"education","lineage":["https://openalex.org/I141591182"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"SHIETUNG PENG","raw_affiliation_strings":["School of Computer Science and Engineering, The University of Aizu, Aizu-wakamatsu, Fukushima Pref, Japan","School of Computer Science and Engineering , The University of Aizu , Aizu-wakamatsu, Fukushima Pref, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, The University of Aizu, Aizu-wakamatsu, Fukushima Pref, Japan","institution_ids":["https://openalex.org/I141591182"]},{"raw_affiliation_string":"School of Computer Science and Engineering , The University of Aizu , Aizu-wakamatsu, Fukushima Pref, Japan","institution_ids":["https://openalex.org/I141591182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016233136","display_name":"Win\u2010Tsung Lo","orcid":"https://orcid.org/0000-0002-9306-5713"},"institutions":[{"id":"https://openalex.org/I126744593","display_name":"University of Maryland, Baltimore","ror":"https://ror.org/04rq5mt64","country_code":"US","type":"education","lineage":["https://openalex.org/I126744593"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"WIN-TSUNG LO","raw_affiliation_strings":["Computer Science Department, University of Maryland, Baltimore, MD, 21228, USA","Computer Science Department , University of Maryland , Baltimore, MD, 21228, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Maryland, Baltimore, MD, 21228, USA","institution_ids":["https://openalex.org/I126744593"]},{"raw_affiliation_string":"Computer Science Department , University of Maryland , Baltimore, MD, 21228, USA","institution_ids":["https://openalex.org/I126744593"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.25045583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"1-2","first_page":"43","last_page":"60"},"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.9998000264167786,"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.9998000264167786,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955999851226807,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6498281955718994},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6374529600143433},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.6089086532592773},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5987269878387451},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5775219202041626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5483345985412598},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.4892106056213379},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4817347824573517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40880170464515686},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09617117047309875}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6498281955718994},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6374529600143433},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6089086532592773},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5987269878387451},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5775219202041626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5483345985412598},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.4892106056213379},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4817347824573517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40880170464515686},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09617117047309875},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199408915406","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915406","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320337392","display_name":"Division of Electrical, Communications and Cyber Systems","ror":"https://ror.org/01krpsy48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1535011786","https://openalex.org/W1965874601","https://openalex.org/W1968276546","https://openalex.org/W2013444956","https://openalex.org/W2034282023","https://openalex.org/W2060635739","https://openalex.org/W2081385108","https://openalex.org/W2085579980","https://openalex.org/W2127859636","https://openalex.org/W2157047836","https://openalex.org/W2171350309","https://openalex.org/W2171608071"],"related_works":["https://openalex.org/W769960296","https://openalex.org/W2015646948","https://openalex.org/W2146500544","https://openalex.org/W2593735092","https://openalex.org/W47157557","https://openalex.org/W1981372308","https://openalex.org/W2023949930","https://openalex.org/W2074659255","https://openalex.org/W3125600016","https://openalex.org/W4226003002"],"abstract_inverted_index":{"Efficient":[0],"parallel":[1],"algorithms":[2,42],"for":[3,43],"finding":[4,44,81],"an":[5],"optimal":[6],"path-shaped":[7],"or":[8],"tree-shaped":[9],"facility":[10,36],"with":[11],"a":[12,16,45,82,99],"specified":[13],"size":[14],"in":[15,51,59,71,89],"tree":[17],"network":[18],"are":[19,26,31,57],"presented.":[20],"Four":[21],"kinds":[22],"of":[23,63,80],"optimization":[24,39],"criteria":[25],"considered:":[27],"minimizing/maximizing":[28],"distancesum/eccentricity.":[29],"There":[30],"eight":[32],"cases":[33,56,66],"when":[34],"considering":[35],"shapes":[37],"and":[38],"criteria.":[40],"Parallel":[41],"minimum/maximum":[46],"distancesum":[47,84],"path":[48],"were":[49],"presented":[50,88],"[9].":[52],"The":[53],"other":[54],"six":[55,65],"studied":[58],"this":[60,90],"paper.":[61],"Two":[62],"these":[64],"can":[67],"be":[68],"solved":[69],"optimally":[70],"linear":[72],"Time":[73],"x":[74],"Processor":[75],"complexity.":[76],"For":[77],"the":[78,86,93],"problem":[79],"maximum":[83],"tree,":[85],"algorithm":[87],"paper":[91],"is":[92],"first":[94],"polynomial":[95],"time":[96],"solution":[97],"under":[98],"reasonable":[100],"assumption.":[101]},"counts_by_year":[],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}