{"id":"https://openalex.org/W2025973739","doi":"https://doi.org/10.1002/(sici)1097-0037(199605)27:3<219::aid-net7>3.0.co;2-l","title":"A single facility location problem on a tree with unreliable edges","display_name":"A single facility location problem on a tree with unreliable edges","publication_year":1996,"publication_date":"1996-05-01","ids":{"openalex":"https://openalex.org/W2025973739","doi":"https://doi.org/10.1002/(sici)1097-0037(199605)27:3<219::aid-net7>3.0.co;2-l","mag":"2025973739"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199605)27:3<219::aid-net7>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199605)27:3<219::aid-net7>3.0.co;2-l","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5085925449","display_name":"Emanuel Melachrinoudis","orcid":"https://orcid.org/0000-0002-1929-0963"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Emanuel Melachrinoudis","raw_affiliation_strings":["Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts 02115","Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts, 02115"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts 02115","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts, 02115","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026604484","display_name":"Mary E. Helander","orcid":"https://orcid.org/0000-0002-5185-6867"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mary E. Helander","raw_affiliation_strings":["Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts 02115","Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts, 02115"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts 02115","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts, 02115","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085925449"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.6647,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.84744998,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"27","issue":"3","first_page":"219","last_page":"237"},"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.9990000128746033,"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.9990000128746033,"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.9793000221252441,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9053999781608582,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/tree-traversal","display_name":"Tree traversal","score":0.6108999252319336},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5682812929153442},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.49346935749053955},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4816107451915741},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.479830265045166},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4691582918167114},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46870607137680054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4563797116279602},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4392208755016327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4306701421737671},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4268971085548401},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.4190228581428528},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40412020683288574},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3116523027420044}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6108999252319336},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5682812929153442},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49346935749053955},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4816107451915741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.479830265045166},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4691582918167114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46870607137680054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4563797116279602},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4392208755016327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4306701421737671},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4268971085548401},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.4190228581428528},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40412020683288574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3116523027420044},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199605)27:3<219::aid-net7>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199605)27:3<219::aid-net7>3.0.co;2-l","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W4301044568","https://openalex.org/W1587123803","https://openalex.org/W2358177744","https://openalex.org/W1567541092","https://openalex.org/W2361081252"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,41,44,54,95,118,145,149],"problem":[4,150],"of":[5,57,94,121,148],"determining":[6],"a":[7,49,105,113,156,161,165],"single":[8],"facility":[9],"location":[10,51],"on":[11,112,164],"an":[12,87,92,108,122],"undirected":[13],"tree":[14],"with":[15,23,38],"n":[16],"nodes":[17,58],"and":[18,75,107,117,129,133,142],"edges":[19],"that":[20,29,52],"fail":[21],"independently":[22],"probability":[24],"(1":[25],"\u2212":[26],"pe)":[27],"so":[28],"service":[30],"provided":[31],"to":[32,47],"demand":[33],"points":[34],"can":[35],"be":[36],"achieved":[37],"reliability.":[39],"Termed":[40],"relisum":[42,162],"problem,":[43],"objective":[45],"is":[46,66,91],"find":[48],"network":[50],"maximizes":[53],"expected":[55],"number":[56],"reachable":[59],"by":[60],"operational":[61,123],"paths.":[62],"A":[63],"decomposition":[64,119],"formula":[65],"developed":[67],"for":[68,98,136,144,159],"which":[69,90],"several":[70],"properties":[71],"are":[72,80,85,127,138,151],"analytically":[73,139],"derived":[74],"realistic":[76],"vertex":[77],"optimality":[78],"conditions":[79],"identified.":[81],"Two":[82],"polynomial":[83,157],"algorithms":[84,143],"presented:":[86],"O(n3)":[88],"algorithm":[89,97,110],"adaptation":[93],"Floyd-Warshall":[96],"finding":[99,160],"all":[100],"pairwise":[101],"shortest":[102],"paths":[103],"in":[104],"graph":[106],"O(n2)":[109],"based":[111],"depth-first":[114],"node":[115,163],"traversal":[116],"nature":[120],"path.":[124],"Computational":[125],"results":[126],"provided,":[128],"sensitivity":[130],"analysis":[131],"ranges":[132],"marginal":[134],"values":[135],"pe":[137],"derived.":[140],"Properties":[141],"weighted":[146],"version":[147],"discussed,":[152],"as":[153,155],"well":[154],"heuristic":[158],"cyclic":[166],"network.":[167],"\u00a9":[168],"1996":[169],"John":[170],"Wiley":[171],"&":[172],"Sons,":[173],"Inc.":[174]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}