{"id":"https://openalex.org/W2508049261","doi":"https://doi.org/10.1002/net.21698","title":"Mixed planar and network single\u2010facility location problems","display_name":"Mixed planar and network single\u2010facility location problems","publication_year":2016,"publication_date":"2016-08-18","ids":{"openalex":"https://openalex.org/W2508049261","doi":"https://doi.org/10.1002/net.21698","mag":"2508049261"},"language":"en","primary_location":{"id":"doi:10.1002/net.21698","doi":"https://doi.org/10.1002/net.21698","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21698","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,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"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"},"volume":null,"type":"article","is_traditional":true,"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/A5056737913","display_name":"Zvi Drezner","orcid":"https://orcid.org/0000-0002-0581-8958","observed_orcids":["https://orcid.org/0000-0002-0581-8958"]},"institutions":[{"id":"https://openalex.org/I142934699","display_name":"California State University, Fullerton","ror":"https://ror.org/02avqqw26","country_code":"US","type":"education","lineage":["https://openalex.org/I142934699"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zvi Drezner","raw_affiliation_strings":["Steven G. Mihaylo College of Business and Economics, California State University, Fullerton, California, 92834"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Steven G. Mihaylo College of Business and Economics, California State University, Fullerton, California, 92834","institution_ids":["https://openalex.org/I142934699"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111859536","display_name":"Carlton H. Scott","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carlton H. Scott","raw_affiliation_strings":["Paul Merage School of Business, University of California, Irvine, California, 92697"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Paul Merage School of Business, University of California, Irvine, California, 92697","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003540115","display_name":"John G. Turner","orcid":"https://orcid.org/0000-0002-5835-1247","observed_orcids":["https://orcid.org/0000-0002-5835-1247"]},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Turner","raw_affiliation_strings":["Paul Merage School of Business, University of California, Irvine, California, 92697"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Paul Merage School of Business, University of California, Irvine, California, 92697","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056737913"],"corresponding_institution_ids":["https://openalex.org/I142934699"],"apc_list":{"value":3750,"currency":"USD","value_usd":3750},"apc_paid":null,"fwci":0.9353,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.78839082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"68","issue":"4","first_page":"271","last_page":"282"},"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/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"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/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"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.0003000000142492354,"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":0.00019999999494757503,"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/single-facility-location","display_name":"single facility location","score":0.9480000138282776},{"id":"https://openalex.org/keywords/planar-networks","display_name":"planar networks","score":0.5979999899864197},{"id":"https://openalex.org/keywords/shortest-path-length","display_name":"shortest path length","score":0.7979999780654907},{"id":"https://openalex.org/keywords/weighted-distance-minimization","display_name":"weighted distance minimization","score":0.847000002861023},{"id":"https://openalex.org/keywords/global-optimization","display_name":"global optimization","score":0.9089999794960022}],"concepts":[{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6828781962394714},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6679390072822571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6334133148193359},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5675728917121887},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5425896644592285},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5379974842071533},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.5094364285469055},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4850825369358063},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4710262715816498},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4647155702114105},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.45446884632110596},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4467785060405731},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4442596137523651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2936285436153412},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1257375180721283},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11670970916748047},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10043054819107056},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1002/net.21698","doi":"https://doi.org/10.1002/net.21698","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21698","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,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"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"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt06z4t4c4","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/06z4t4c4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Networks, vol 68, iss 4","raw_type":"article"},{"id":"pmh:oai:escholarship.org:ark:/13030/qt06z4t4c4","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/06z4t4c4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Networks, vol 68, iss 4","raw_type":"article"},{"id":"pmh:qt06z4t4c4","doi":null,"is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/06z4t4c4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Drezner, Z; Scott, CH; & Turner, J. (2016). Mixed Planar and Network Single-Facility Location Problems. NETWORKS, 68(4), 271 - 282. doi: 10.1002/net.21698. UC Irvine: Retrieved from: http://www.escholarship.org/uc/item/06z4t4c4","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5378999710083008,"display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":76,"referenced_works":["https://openalex.org/W62076587","https://openalex.org/W154387869","https://openalex.org/W1504885427","https://openalex.org/W1593256017","https://openalex.org/W1965108988","https://openalex.org/W1967726020","https://openalex.org/W1969162268","https://openalex.org/W1973910373","https://openalex.org/W1975244811","https://openalex.org/W1976122053","https://openalex.org/W1976155842","https://openalex.org/W1977319619","https://openalex.org/W1978717877","https://openalex.org/W1982512167","https://openalex.org/W1985025885","https://openalex.org/W1985658652","https://openalex.org/W1991595252","https://openalex.org/W1993450447","https://openalex.org/W1999182072","https://openalex.org/W2004314127","https://openalex.org/W2005736068","https://openalex.org/W2006188278","https://openalex.org/W2007572995","https://openalex.org/W2008959214","https://openalex.org/W2014149569","https://openalex.org/W2014250279","https://openalex.org/W2023732812","https://openalex.org/W2026589647","https://openalex.org/W2026620234","https://openalex.org/W2028552829","https://openalex.org/W2029681015","https://openalex.org/W2030994722","https://openalex.org/W2037920643","https://openalex.org/W2038173254","https://openalex.org/W2038933051","https://openalex.org/W2040546552","https://openalex.org/W2044466644","https://openalex.org/W2049830459","https://openalex.org/W2050000782","https://openalex.org/W2051632436","https://openalex.org/W2054920135","https://openalex.org/W2056119974","https://openalex.org/W2060223209","https://openalex.org/W2060798327","https://openalex.org/W2065055074","https://openalex.org/W2068197938","https://openalex.org/W2068255187","https://openalex.org/W2074290597","https://openalex.org/W2074660787","https://openalex.org/W2082040042","https://openalex.org/W2083803311","https://openalex.org/W2102750402","https://openalex.org/W2109962606","https://openalex.org/W2115581611","https://openalex.org/W2119897462","https://openalex.org/W2123845242","https://openalex.org/W2127847814","https://openalex.org/W2127859636","https://openalex.org/W2132210811","https://openalex.org/W2133962824","https://openalex.org/W2139594840","https://openalex.org/W2141063236","https://openalex.org/W2144319167","https://openalex.org/W2148113257","https://openalex.org/W2153171506","https://openalex.org/W2155850117","https://openalex.org/W2159541789","https://openalex.org/W2163623315","https://openalex.org/W2180156595","https://openalex.org/W2342478160","https://openalex.org/W2482449879","https://openalex.org/W2491360013","https://openalex.org/W2802627035","https://openalex.org/W2999097525","https://openalex.org/W4238714550","https://openalex.org/W4252801674"],"related_works":["https://openalex.org/W2060798327","https://openalex.org/W1697153862","https://openalex.org/W4386891702","https://openalex.org/W1965209739","https://openalex.org/W7100822786","https://openalex.org/W85155550","https://openalex.org/W4405597592","https://openalex.org/W7101952182","https://openalex.org/W2039195319","https://openalex.org/W2319640809"],"abstract_inverted_index":{"We":[0,82,121],"consider":[1],"the":[2,38,51,61,74,126,146],"problem":[3,141],"of":[4,50,148,180],"optimally":[5],"locating":[6],"a":[7,12,25,34,92,101,114,164,178],"single":[8],"facility":[9],"anywhere":[10],"in":[11,24,37,60,134],"network":[13,35,52,98],"to":[14,33,78,86],"serve":[15],"both":[16],"on\u2010network":[17,29],"and":[18,112],"off\u2010network":[19],"demands.":[20],"Off\u2010network":[21],"demands":[22,30],"occur":[23],"Euclidean":[26,68,110],"plane,":[27],"while":[28],"are":[31,43,63,154],"restricted":[32],"embedded":[36],"plane.":[39],"On\u2010network":[40],"demand":[41,57,80],"points":[42,58],"serviced":[44,64],"using":[45,65,109,125],"shortest\u2010path":[46],"distances":[47],"through":[48],"links":[49],"(e.g.,":[53],"on\u2010road":[54],"travel),":[55],"whereas":[56],"located":[59],"plane":[62],"more":[66],"expensive":[67],"distances.":[69],"Our":[70],"base":[71,88],"objective":[72],"minimizes":[73,118],"total":[75],"weighted":[76],"distance":[77,94,99],"all":[79],"points.":[81],"develop":[83],"several":[84],"extensions":[85],"our":[87,123,149,162],"model,":[89],"including:":[90],"(i)":[91],"threshold":[93],"model":[95,116],"where":[96],"if":[97],"exceeds":[100],"given":[102],"threshold,":[103],"then":[104],"service":[105],"is":[106],"always":[107],"provided":[108],"distance,":[111],"(ii)":[113],"minimax":[115],"that":[117,172],"worst\u2010case":[119],"distance.":[120],"solve":[122,173],"formulations":[124],"\u201cBig":[127],"Segment":[128],"Small":[129],"Segment\u201d":[130],"global":[131],"optimization":[132],"method,":[133],"conjunction":[135],"with":[136],"bounds":[137],"tailored":[138],"for":[139,167],"each":[140],"class.":[142],"Computational":[143],"experiments":[144],"demonstrate":[145],"effectiveness":[147],"solution":[150],"procedures.":[151],"Solution":[152],"times":[153],"very":[155],"fast":[156],"(often":[157],"under":[158],"one":[159],"second),":[160],"making":[161],"approach":[163],"good":[165],"candidate":[166],"embedding":[168],"within":[169],"existing":[170],"heuristics":[171],"multi\u2010facility":[174],"problems":[175],"by":[176],"solving":[177],"sequence":[179],"single\u2010facility":[181],"problems.":[182],"\u00a9":[183],"2016":[184,192],"Wiley":[185],"Periodicals,":[186],"Inc.":[187],"NETWORKS,":[188],"Vol.":[189],"68(4),":[190],"271\u2013282":[191]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-09-16T00:00:00"}