{"id":"https://openalex.org/W2133044393","doi":"https://doi.org/10.1002/net.3230200306","title":"An application of lagrangean decomposition to the resource\u2010constrained minimum weighted arborescence problem","display_name":"An application of lagrangean decomposition to the resource\u2010constrained minimum weighted arborescence problem","publication_year":1990,"publication_date":"1990-05-01","ids":{"openalex":"https://openalex.org/W2133044393","doi":"https://doi.org/10.1002/net.3230200306","mag":"2133044393"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230200306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200306","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/A5021321550","display_name":"Monique Guignard","orcid":"https://orcid.org/0000-0003-4084-434X"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Monique Guignard","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, Pennsylvania 19104","University of Pennsylvania Philadelphia Pennsylvania 19104"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, Pennsylvania 19104","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"University of Pennsylvania Philadelphia Pennsylvania 19104","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027296395","display_name":"Moshe B. Rosenwein","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Moshe B. Rosenwein","raw_affiliation_strings":["AT&T Bell Laboratories, Holmdel, New Jersey 07733","AT&T Bell Lab, Holmdel, New Jersey 07733"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, Holmdel, New Jersey 07733","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Bell Lab, Holmdel, New Jersey 07733","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021321550"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1079,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.82117484,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":96},"biblio":{"volume":"20","issue":"3","first_page":"345","last_page":"359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9886999726295471,"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.9886999726295471,"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/T11208","display_name":"Lignin and Wood Chemistry","score":0.9593999981880188,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9136000275611877,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/decomposition","display_name":"Decomposition","score":0.7399854063987732},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6729612350463867},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.649706244468689},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6111816167831421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.58845454454422},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.5228163003921509},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.5059148669242859},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.49967145919799805},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4284774363040924},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.4218597412109375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36200788617134094},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24802106618881226},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12701526284217834}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.7399854063987732},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6729612350463867},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.649706244468689},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6111816167831421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.58845454454422},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.5228163003921509},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5059148669242859},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49967145919799805},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4284774363040924},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.4218597412109375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36200788617134094},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24802106618881226},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12701526284217834},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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.1002/net.3230200306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200306","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":18,"referenced_works":["https://openalex.org/W56102282","https://openalex.org/W74564317","https://openalex.org/W1492845317","https://openalex.org/W1964443412","https://openalex.org/W1988615825","https://openalex.org/W1989023497","https://openalex.org/W2012682597","https://openalex.org/W2014686215","https://openalex.org/W2017127755","https://openalex.org/W2035177959","https://openalex.org/W2065033231","https://openalex.org/W2069618627","https://openalex.org/W2094651924","https://openalex.org/W2104431850","https://openalex.org/W2147771379","https://openalex.org/W2468321705","https://openalex.org/W3164660163","https://openalex.org/W4242130683"],"related_works":["https://openalex.org/W3024185138","https://openalex.org/W2012045681","https://openalex.org/W2462476910","https://openalex.org/W4236859340","https://openalex.org/W4384009877","https://openalex.org/W4220674099","https://openalex.org/W1999365111","https://openalex.org/W2079491514","https://openalex.org/W42374515","https://openalex.org/W2187844606"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"resource\u2010constrained":[2],"minimum":[3],"weighted":[4],"arborescence":[5],"problem,":[6],"a":[7,38,63,72,80],"0\u20101":[8,92],"integer":[9],"programming":[10],"model":[11,23],"with":[12,88],"application":[13],"in":[14],"hierarchical":[15],"distribution":[16],"network":[17],"design,":[18],"is":[19,24,29,44,55,84],"introduced.":[20],"Since":[21],"the":[22,47],"NP\u2010hard,":[25],"an":[26],"enumeration":[27,68],"method":[28],"required":[30],"to":[31,34,46,57,78,90],"solve":[32,79],"it":[33],"optimality.":[35],"Lagrangean":[36,42,53,65,74,81],"decomposition,":[37],"special":[39],"form":[40],"of":[41],"relaxation,":[43],"applied":[45],"model.":[48],"Both":[49],"analytically":[50],"and":[51,86],"empirically,":[52],"decomposition":[54,82],"shown":[56],"improve":[58],"on":[59],"bounds":[60],"obtained":[61],"by":[62],"conventional":[64],"relaxation.":[66],"An":[67],"algorithm,":[69],"that":[70],"embeds":[71],"specialized":[73],"dual":[75],"ascent":[76],"scheme":[77],"dual,":[83],"designed,":[85],"problems":[87],"up":[89],"1000":[91],"variables":[93],"are":[94],"solved.":[95]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}