{"id":"https://openalex.org/W2000675190","doi":"https://doi.org/10.1002/net.3230150102","title":"Lagrangian relaxation for the star\u2010star concentrator location problem: Approximation algorithm and bounds","display_name":"Lagrangian relaxation for the star\u2010star concentrator location problem: Approximation algorithm and bounds","publication_year":1985,"publication_date":"1985-03-01","ids":{"openalex":"https://openalex.org/W2000675190","doi":"https://doi.org/10.1002/net.3230150102","mag":"2000675190"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230150102","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150102","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/A5113587884","display_name":"Andranik Mirzaian","orcid":null},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Andranik Mirzaian","raw_affiliation_strings":["Computer Science Department, York University, Downsview, Ontario, Canada M3J 1P3"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, York University, Downsview, Ontario, Canada M3J 1P3","institution_ids":["https://openalex.org/I192455969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113587884"],"corresponding_institution_ids":["https://openalex.org/I192455969"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":9.4189,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.97399749,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":"1","first_page":"1","last_page":"20"},"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.9969000220298767,"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.9969000220298767,"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.9940000176429749,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9787999987602234,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.7522605657577515},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.7445983290672302},{"id":"https://openalex.org/keywords/concentrator","display_name":"Concentrator","score":0.7397655248641968},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6353211998939514},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6223726272583008},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.5995410084724426},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5985603928565979},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5822405219078064},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5369429588317871},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5265729427337646},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5222378969192505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.506327748298645},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4215499758720398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3518376350402832},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.30459147691726685},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10669577121734619}],"concepts":[{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.7522605657577515},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7445983290672302},{"id":"https://openalex.org/C15469602","wikidata":"https://www.wikidata.org/wiki/Q1783614","display_name":"Concentrator","level":2,"score":0.7397655248641968},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6353211998939514},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6223726272583008},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.5995410084724426},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5985603928565979},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5822405219078064},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5369429588317871},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5265729427337646},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5222378969192505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.506327748298645},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4215499758720398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3518376350402832},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.30459147691726685},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10669577121734619},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230150102","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150102","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1527658630","https://openalex.org/W1655990431","https://openalex.org/W1680189815","https://openalex.org/W1969559414","https://openalex.org/W1972312685","https://openalex.org/W2009803313","https://openalex.org/W2011039300","https://openalex.org/W2017697298","https://openalex.org/W2033151347","https://openalex.org/W2052862856","https://openalex.org/W2053913299","https://openalex.org/W2058748455","https://openalex.org/W2069323107","https://openalex.org/W2075910004","https://openalex.org/W2101240310","https://openalex.org/W2107367810","https://openalex.org/W2139211712","https://openalex.org/W2158318958","https://openalex.org/W2165012734","https://openalex.org/W2258857078","https://openalex.org/W2743807112","https://openalex.org/W4242130683","https://openalex.org/W4250828313"],"related_works":["https://openalex.org/W3149469165","https://openalex.org/W4313484281","https://openalex.org/W4252122881","https://openalex.org/W4383905034","https://openalex.org/W181997498","https://openalex.org/W1984467068","https://openalex.org/W2027845496","https://openalex.org/W3126007678","https://openalex.org/W134055995","https://openalex.org/W2170308554"],"abstract_inverted_index":{"Abstract":[0],"The":[1,24,47],"star\u2010star":[2],"concentrator":[3,105,118],"location":[4],"problem":[5],"(SSCLP),":[6],"which":[7],"is":[8,13,16,29,65,82,103],"a":[9,72,78],"network":[10,124],"layout":[11],"problem,":[12],"considered.":[14,121],"SSCLP":[15,68],"formulated":[17],"as":[18],"an":[19],"integer":[20],"linear":[21,59],"programming":[22,60],"problem.":[23],"Lagrangian":[25,49],"relaxation":[26],"(LR)":[27],"method":[28],"used":[30,44],"to":[31,54,57,112,129],"obtain":[32],"suboptimal":[33],"solutions":[34],"(upper":[35,75],"bounds)":[36],"and":[37,77,87,91,115],"lower":[38,79,90],"bounds.":[39],"Three":[40],"different":[41],"LRs":[42],"are":[43,52,120,127],"for":[45,67],"SSCLP.":[46],"resulting":[48],"dual":[50],"problems":[51],"shown":[53,83,128],"be":[55,130],"equivalent":[56],"some":[58],"problems.":[61],"An":[62],"approximation":[63],"algorithm":[64],"suggested":[66],"that":[69,84],"produces":[70],"both":[71],"feasible":[73],"solution":[74],"bound)":[76],"bound.":[80],"It":[81],"if":[85],"z":[86,97],"z\u0304are":[88],"the":[89,104,123],"upper":[92],"bounds":[93],"found,":[94],"then":[95],"z\u0304/":[96],"\u2264":[98],"k":[99,102],",":[100],"where":[101],"capacity.":[106],"Some":[107],"computational":[108],"examples":[109],"with":[110],"up":[111],"50":[113],"terminals":[114],"20":[116],"potential":[117],"sites":[119],"All":[122],"designs":[125],"obtained":[126],"within":[131],"2.8%":[132],"of":[133],"optimal.":[134]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}