{"id":"https://openalex.org/W1996106387","doi":"https://doi.org/10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e","title":"A branch and cut method for the degree-constrained minimum spanning tree problem","display_name":"A branch and cut method for the degree-constrained minimum spanning tree problem","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1996106387","doi":"https://doi.org/10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e","mag":"1996106387"},"language":"en","primary_location":{"id":"doi:10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e","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/A5063625697","display_name":"Louis Caccetta","orcid":"https://orcid.org/0000-0003-2405-2721"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"L. Caccetta","raw_affiliation_strings":["School of Mathematics and Statistics, GPO Box U1987, Perth, 6845, Western Australia"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, GPO Box U1987, Perth, 6845, Western Australia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083503407","display_name":"Stephen P. Hill","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S.P. Hill","raw_affiliation_strings":["School of Mathematics and Statistics, GPO Box U1987, Perth, 6845, Western Australia"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, GPO Box U1987, Perth, 6845, Western Australia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063625697"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.5056,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.90906486,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"37","issue":"2","first_page":"74","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9975000023841858,"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.9975000023841858,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9968000054359436,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8044582605361938},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7601292133331299},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6383041143417358},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6165000796318054},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.600247859954834},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5291951894760132},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.52491295337677},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49815988540649414},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48424193263053894},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.47534868121147156},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.43419912457466125},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4309958815574646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41710662841796875},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.2757660150527954}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8044582605361938},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7601292133331299},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6383041143417358},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6165000796318054},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.600247859954834},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5291951894760132},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.52491295337677},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49815988540649414},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48424193263053894},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.47534868121147156},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.43419912457466125},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4309958815574646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41710662841796875},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2757660150527954},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e","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":13,"referenced_works":["https://openalex.org/W595376556","https://openalex.org/W1965680834","https://openalex.org/W1968665498","https://openalex.org/W1971782520","https://openalex.org/W1982512167","https://openalex.org/W1995670816","https://openalex.org/W2017127755","https://openalex.org/W2029242918","https://openalex.org/W2032527321","https://openalex.org/W2033983963","https://openalex.org/W2035231387","https://openalex.org/W2038583281","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W4242086819","https://openalex.org/W2387385213","https://openalex.org/W2418231958","https://openalex.org/W2074214908","https://openalex.org/W2589768050","https://openalex.org/W2099915933","https://openalex.org/W3016811403","https://openalex.org/W2015718828","https://openalex.org/W2943635264"],"abstract_inverted_index":{"A":[0],"problem":[1],"of":[2,9],"interest":[3],"in":[4,11],"network":[5],"design":[6],"is":[7,40],"that":[8],"finding,":[10],"a":[12,16,28],"given":[13],"weighted":[14],"graph,":[15],"minimum-weight":[17],"spanning":[18],"tree":[19],"whose":[20],"vertices":[21,57],"satisfy":[22],"specified":[23],"degree":[24],"restrictions.":[25],"We":[26],"present":[27],"branch":[29],"and":[30,42,60],"cut":[31],"solution":[32],"procedure":[33],"for":[34],"this":[35],"NP-complete":[36],"problem.":[37],"Our":[38],"algorithm":[39],"implemented":[41],"extensively":[43],"tested.":[44],"Computational":[45],"results":[46],"on":[47],"3150":[48],"random":[49],"table":[50],"problems":[51],"ranging":[52],"from":[53],"100":[54],"to":[55],"800":[56],"are":[58],"presented":[59],"discussed.":[61],"\u00a9":[62],"2001":[63],"John":[64],"Wiley":[65],"&":[66],"Sons,":[67],"Inc.":[68]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}