{"id":"https://openalex.org/W2104431850","doi":"https://doi.org/10.1109/tcom.1985.1096250","title":"Augmented Lagrangean Based Algorithms for Centralized Network Design","display_name":"Augmented Lagrangean Based Algorithms for Centralized Network Design","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W2104431850","doi":"https://doi.org/10.1109/tcom.1985.1096250","mag":"2104431850"},"language":"en","primary_location":{"id":"doi:10.1109/tcom.1985.1096250","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcom.1985.1096250","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","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/A5025923476","display_name":"Bezalel Gavish","orcid":null},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Gavish","raw_affiliation_strings":["University of Rochester, Rochester, NY, USA","Univ of Rochester, Rochester, NY, USA"],"affiliations":[{"raw_affiliation_string":"University of Rochester, Rochester, NY, USA","institution_ids":["https://openalex.org/I5388228"]},{"raw_affiliation_string":"Univ of Rochester, Rochester, NY, USA","institution_ids":["https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025923476"],"corresponding_institution_ids":["https://openalex.org/I5388228"],"apc_list":null,"apc_paid":null,"fwci":4.1019,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.92896311,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"33","issue":"12","first_page":"1247","last_page":"1257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996999979019165,"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/T12176","display_name":"Optimization and Packing Problems","score":0.980400025844574,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9789000153541565,"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/subgradient-method","display_name":"Subgradient method","score":0.9139946699142456},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7460645437240601},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.636892557144165},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5461867451667786},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5304198861122131},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5130125880241394},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4940207600593567},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.48778897523880005},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.47943609952926636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46809104084968567},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4580574929714203},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.44016796350479126},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40878236293792725}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9139946699142456},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7460645437240601},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.636892557144165},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5461867451667786},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5304198861122131},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5130125880241394},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4940207600593567},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.48778897523880005},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.47943609952926636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46809104084968567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4580574929714203},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.44016796350479126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40878236293792725},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcom.1985.1096250","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcom.1985.1096250","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","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":26,"referenced_works":["https://openalex.org/W1530075571","https://openalex.org/W1554451661","https://openalex.org/W1572233287","https://openalex.org/W1963574949","https://openalex.org/W1964705035","https://openalex.org/W1972674272","https://openalex.org/W1983743030","https://openalex.org/W2008200956","https://openalex.org/W2009803313","https://openalex.org/W2012682597","https://openalex.org/W2017127755","https://openalex.org/W2017697298","https://openalex.org/W2025325419","https://openalex.org/W2052862856","https://openalex.org/W2055346175","https://openalex.org/W2058748455","https://openalex.org/W2074744922","https://openalex.org/W2077053998","https://openalex.org/W2082260357","https://openalex.org/W2103054960","https://openalex.org/W2114045721","https://openalex.org/W2125554210","https://openalex.org/W2152413298","https://openalex.org/W2998284211","https://openalex.org/W4242130683","https://openalex.org/W6656828965"],"related_works":["https://openalex.org/W1925942709","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W2049080118","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W3116484972"],"abstract_inverted_index":{"Capacitated":[0],"spanning":[1],"tree":[2],"problems":[3,8],"appear":[4],"frequently":[5],"as":[6],"fundamental":[7],"in":[9,78,122,141],"many":[10],"communication":[11],"network":[12],"design":[13],"problems.":[14],"An":[15,131],"integer":[16],"programming":[17],"formulation":[18],"and":[19,42,67,98,157],"a":[20,38,62,116],"new":[21],"set":[22],"of":[23,32,37,61,64],"valid":[24],"inequalities":[25],"are":[26,85,88,162],"presented":[27],"for":[28],"the":[29,33,65,68,91,127,137,150],"linear":[30],"characterization":[31],"problem.":[34,151],"A":[35],"combination":[36],"subgradient":[39,117],"optimization":[40,118],"procedure":[41,46,55,103,119,153],"an":[43,58,95,99,142],"augmented":[44],"Lagrangean-based":[45],"is":[47,72,76,104,111,120,134],"used":[48],"to":[49,80,90,124,136,144,149],"generate":[50,145],"tight":[51],"lower":[52,128],"bounds.":[53],"The":[54,74,152],"begins":[56],"with":[57],"explicit":[59],"representation":[60],"subset":[63],"constraints,":[66],"corresponding":[69],"Lagrangean":[70,92,139],"problem":[71],"solved.":[73],"solution":[75],"examined":[77],"order":[79,123],"identify":[81],"implicit":[82],"constraints":[83],"that":[84,161],"violated.":[86],"Those":[87],"added":[89],"problem,":[93,97],"forming":[94],"expanded":[96],"efficient":[100],"dual":[101],"ascent":[102],"then":[105],"applied.":[106],"When":[107],"no":[108],"further":[109,125],"improvement":[110],"possible":[112],"through":[113,168],"this":[114],"procedure,":[115],"invoked":[121],"tighten":[126],"bound":[129],"value.":[130],"exchange":[132],"heuristic":[133],"applied":[135],"nonfeasible":[138],"solution,":[140],"attempt":[143],"good":[146],"feasible":[147],"solutions":[148],"has":[154,158],"been":[155],"tested":[156],"generated":[159],"bounds":[160],"significantly":[163],"better":[164],"than":[165],"ones":[166],"obtained":[167],"previously":[169],"published":[170],"procedures.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}