{"id":"https://openalex.org/W2065033231","doi":"https://doi.org/10.1002/net.3230130203","title":"Constructing a minimal\u2010cost spanning tree subject to resource constraints and flow requirements","display_name":"Constructing a minimal\u2010cost spanning tree subject to resource constraints and flow requirements","publication_year":1983,"publication_date":"1983-06-01","ids":{"openalex":"https://openalex.org/W2065033231","doi":"https://doi.org/10.1002/net.3230130203","mag":"2065033231"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130203","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130203","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/A5017851977","display_name":"Andrew W. Shogan","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew W. Shogan","raw_affiliation_strings":["University of California, Berkeley, California"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017851977"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.5022,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84639861,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"2","first_page":"169","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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.9965999722480774,"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.992900013923645,"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/T11106","display_name":"Data Management and Algorithms","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/computer-science","display_name":"Computer science","score":0.6287624835968018},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6271253228187561},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.6175522804260254},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6056222915649414},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.5564221739768982},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4678182303905487},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.46384504437446594},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.46155214309692383},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4539785087108612},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.41178685426712036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2871765196323395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14611369371414185},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10754522681236267}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6287624835968018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6271253228187561},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.6175522804260254},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6056222915649414},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5564221739768982},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4678182303905487},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.46384504437446594},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.46155214309692383},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4539785087108612},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.41178685426712036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2871765196323395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14611369371414185},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10754522681236267},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230130203","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130203","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":[{"id":"https://metadata.un.org/sdg/8","score":0.4099999964237213,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W94213613","https://openalex.org/W224775207","https://openalex.org/W1004918569","https://openalex.org/W1576264907","https://openalex.org/W1965680834","https://openalex.org/W1973942323","https://openalex.org/W1991528957","https://openalex.org/W2009803313","https://openalex.org/W2017127755","https://openalex.org/W2017697298","https://openalex.org/W2017927472","https://openalex.org/W2058748455","https://openalex.org/W2074214908","https://openalex.org/W2074744922","https://openalex.org/W2094651924","https://openalex.org/W2128865241","https://openalex.org/W2152413298","https://openalex.org/W2169528473","https://openalex.org/W2751335644","https://openalex.org/W4234612342","https://openalex.org/W4236384091","https://openalex.org/W4242130683"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W3207627914","https://openalex.org/W2270959725","https://openalex.org/W2151525839","https://openalex.org/W648253840","https://openalex.org/W2348121120","https://openalex.org/W2110438635"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"a":[2,9,16,23,26,92,113,136,139,160,167],"network":[3,38],"in":[4],"which":[5],"one":[6],"node":[7,21],"is":[8,22,89],"source":[10,117],"having":[11,25],"an":[12],"infinite":[13],"supply":[14,80],"of":[15,36,46,52,60,67,81,83,103,134,152,156,170],"commodity,":[17],"and":[18,63,107,141,159],"every":[19],"other":[20],"sink":[24],"known":[27,42,73],"constant":[28],"demand.":[29],"Furthermore,":[30],"associated":[31],"with":[32,166],"each":[33,53,82],"potential":[34],"arc":[35,127],"the":[37,40,44,48,50,58,61,64,68,71,78,84,87,98,101,104,108,116,119,122,132,153,157,171],"are":[39,150],"following":[41],"constants:":[43],"cost":[45],"constructing":[47],"arc,":[49,62],"amount":[51],"scarce":[54,85,105],"resource":[55],"consumed":[56],"during":[57],"construction":[59],"flow":[65,114],"capacity":[66],"arc.":[69],"Given":[70],"above":[72],"constants":[74],"as":[75,77],"well":[76],"available":[79],"resources,":[86],"problem":[88,137],"to":[90,97],"construct":[91],"minimal\u2010cost":[93],"spanning":[94],"tree":[95],"subject":[96],"limitations":[99],"on":[100,145,162],"consumption":[102],"resources":[106],"requirement":[109],"that":[110],"there":[111],"exists":[112],"from":[115],"satisfying":[118],"demands":[120],"at":[121],"sinks":[123],"without":[124],"exceeding":[125],"any":[126],"capacity.":[128],"This":[129],"paper":[130],"discusses":[131],"solution":[133],"such":[135],"by":[138],"branch":[140],"bound":[142],"algorithm":[143],"based":[144],"Lagrangian":[146],"relaxation.":[147],"Also":[148],"included":[149],"applications":[151],"problem,":[154,158],"extensions":[155],"report":[161],"preliminary":[163],"computational":[164],"experience":[165],"computer":[168],"implementation":[169],"algorithm.":[172]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}