{"id":"https://openalex.org/W2811311140","doi":"https://doi.org/10.1080/10556788.2018.1482296","title":"Optimal algorithms for selective variants of the classical and inverse median location problems on trees","display_name":"Optimal algorithms for selective variants of the classical and inverse median location problems on trees","publication_year":2018,"publication_date":"2018-07-03","ids":{"openalex":"https://openalex.org/W2811311140","doi":"https://doi.org/10.1080/10556788.2018.1482296","mag":"2811311140"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2018.1482296","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1482296","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5077434954","display_name":"Esmaeil Afrashteh","orcid":"https://orcid.org/0000-0002-4462-6246"},"institutions":[{"id":"https://openalex.org/I107853901","display_name":"Sahand University of Technology","ror":"https://ror.org/03wdrmh81","country_code":"IR","type":"education","lineage":["https://openalex.org/I107853901"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Esmaeil Afrashteh","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran","institution_ids":["https://openalex.org/I107853901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030410702","display_name":"Behrooz Alizadeh","orcid":"https://orcid.org/0000-0001-5726-2843"},"institutions":[{"id":"https://openalex.org/I107853901","display_name":"Sahand University of Technology","ror":"https://ror.org/03wdrmh81","country_code":"IR","type":"education","lineage":["https://openalex.org/I107853901"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Behrooz Alizadeh","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran","institution_ids":["https://openalex.org/I107853901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047723035","display_name":"Fahimeh Baroughi","orcid":"https://orcid.org/0000-0001-9963-4772"},"institutions":[{"id":"https://openalex.org/I107853901","display_name":"Sahand University of Technology","ror":"https://ror.org/03wdrmh81","country_code":"IR","type":"education","lineage":["https://openalex.org/I107853901"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Fahimeh Baroughi","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran","institution_ids":["https://openalex.org/I107853901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047723035"],"corresponding_institution_ids":["https://openalex.org/I107853901"],"apc_list":null,"apc_paid":null,"fwci":1.5557,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85138011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"6","first_page":"1213","last_page":"1230"},"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.9998999834060669,"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.9998999834060669,"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.9918000102043152,"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.9732999801635742,"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.6589832901954651},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6484502553939819},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.6459953784942627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6077988743782043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5686345100402832},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5446559190750122},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5414602160453796},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4499271810054779},{"id":"https://openalex.org/keywords/1-center-problem","display_name":"1-center problem","score":0.42870911955833435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34390079975128174},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3188568651676178}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6589832901954651},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6484502553939819},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6459953784942627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6077988743782043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5686345100402832},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5446559190750122},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5414602160453796},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4499271810054779},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.42870911955833435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34390079975128174},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3188568651676178},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/10556788.2018.1482296","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1482296","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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":36,"referenced_works":["https://openalex.org/W37347353","https://openalex.org/W73629738","https://openalex.org/W381492219","https://openalex.org/W1482186473","https://openalex.org/W1543319916","https://openalex.org/W1975946049","https://openalex.org/W1984953641","https://openalex.org/W1991347081","https://openalex.org/W1993504087","https://openalex.org/W1999428150","https://openalex.org/W2013884391","https://openalex.org/W2024133475","https://openalex.org/W2032381527","https://openalex.org/W2044016543","https://openalex.org/W2044028040","https://openalex.org/W2045213840","https://openalex.org/W2050773466","https://openalex.org/W2082122685","https://openalex.org/W2088352008","https://openalex.org/W2088391504","https://openalex.org/W2090879820","https://openalex.org/W2102750402","https://openalex.org/W2103145733","https://openalex.org/W2110267245","https://openalex.org/W2127859636","https://openalex.org/W2171350309","https://openalex.org/W2214775348","https://openalex.org/W2330761506","https://openalex.org/W2568832798","https://openalex.org/W2606195968","https://openalex.org/W2946046356","https://openalex.org/W2962898584","https://openalex.org/W4236127247","https://openalex.org/W4238714550","https://openalex.org/W4243557394","https://openalex.org/W4247024249"],"related_works":["https://openalex.org/W2188531628","https://openalex.org/W3046631468","https://openalex.org/W1973310057","https://openalex.org/W4286249718","https://openalex.org/W2007826114","https://openalex.org/W2252210493","https://openalex.org/W1972014896","https://openalex.org/W2067320236","https://openalex.org/W1981372308","https://openalex.org/W2081450974"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2,56,79,89],"concerned":[3],"with":[4,121,133],"selective":[5,38,50,109,128,143],"variants":[6],"of":[7,22,29,40,43,70,84,111],"the":[8,20,27,41,44,48,54,59,68,74,77,82,85,94,98,112,126,141,148],"classical":[9,49,127],"and":[10,26],"inverse":[11,87,142],"median":[12,51,110,144],"location":[13,52,61,106,145],"problems":[14],"on":[15,147],"tree":[16,150],"graphs":[17],"in":[18],"which":[19],"set":[21,28],"existing":[23],"customer":[24],"points":[25],"candidate":[30],"facility":[31,65,78,105],"locations":[32],"are":[33,137],"assumed":[34],"to":[35,57,76,90],"be":[36],"two":[37],"subsets":[39],"vertices":[42],"underlying":[45,113],"tree.":[46,114],"In":[47],"problem,":[53],"aim":[55],"find":[58],"best":[60],"for":[62,125,139],"establishing":[63],"a":[64,103,108,117],"such":[66],"that":[67],"sum":[69],"(weighted)":[71],"distances":[72],"from":[73],"customers":[75],"minimized.":[80],"However,":[81],"task":[83],"corresponding":[86],"model":[88],"augment":[91],"or":[92],"reduce":[93],"edge":[95],"lengths":[96],"at":[97],"minimum":[99],"total":[100],"cost":[101,154],"until":[102],"predetermined":[104],"becomes":[107],"We":[115],"propose":[116],"novel":[118],"optimal":[119,131],"algorithm":[120],"linear":[122],"time":[123,135],"complexity":[124],"model.":[129],"Moreover,":[130],"approaches":[132],"O(nlog\u2061n)":[134],"complexities":[136],"developed":[138],"solving":[140],"problem":[146],"given":[149],"graph":[151],"under":[152],"different":[153],"norms.":[155]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}