{"id":"https://openalex.org/W2088814889","doi":"https://doi.org/10.1057/palgrave.jors.2601821","title":"Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm","display_name":"Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm","publication_year":2004,"publication_date":"2004-08-25","ids":{"openalex":"https://openalex.org/W2088814889","doi":"https://doi.org/10.1057/palgrave.jors.2601821","mag":"2088814889"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601821","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601821","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/A5057119785","display_name":"Mohamed Haouari","orcid":"https://orcid.org/0000-0003-0767-8220"},"institutions":[{"id":"https://openalex.org/I2800887215","display_name":"Tunisia Polytechnic School","ror":"https://ror.org/00dse3307","country_code":"TN","type":"education","lineage":["https://openalex.org/I2800887215"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"M Haouari","raw_affiliation_strings":["Ecole Polytechnique de Tunisie\rLa Marsa\rTunisia"],"affiliations":[{"raw_affiliation_string":"Ecole Polytechnique de Tunisie\rLa Marsa\rTunisia","institution_ids":["https://openalex.org/I2800887215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056890791","display_name":"Jouhaina Chaouachi","orcid":null},"institutions":[{"id":"https://openalex.org/I2800887215","display_name":"Tunisia Polytechnic School","ror":"https://ror.org/00dse3307","country_code":"TN","type":"education","lineage":["https://openalex.org/I2800887215"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"J Chaouachi","raw_affiliation_strings":["Ecole Polytechnique de Tunisie\rLa Marsa\rTunisia"],"affiliations":[{"raw_affiliation_string":"Ecole Polytechnique de Tunisie\rLa Marsa\rTunisia","institution_ids":["https://openalex.org/I2800887215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012490161","display_name":"Moshe Dror","orcid":null},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M Dror","raw_affiliation_strings":["University of Arizona Tucson AZ USA","University of Arizona,Tucson,AZ,USA"],"affiliations":[{"raw_affiliation_string":"University of Arizona Tucson AZ USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"University of Arizona,Tucson,AZ,USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057119785"],"corresponding_institution_ids":["https://openalex.org/I2800887215"],"apc_list":null,"apc_paid":null,"fwci":1.3486,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.80970764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"56","issue":"4","first_page":"382","last_page":"389"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9757000207901001,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9757000207901001,"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"}},{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.975600004196167,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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.9603000283241272,"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/spanning-tree","display_name":"Spanning tree","score":0.7682057619094849},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7525207996368408},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6605676412582397},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6499115228652954},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5672276020050049},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5379780530929565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5353026986122131},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5096237659454346},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49758270382881165},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.495017945766449},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.48685401678085327},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.43672245740890503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32433027029037476},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.25499963760375977},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.168808251619339},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1536698043346405}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7682057619094849},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7525207996368408},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6605676412582397},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6499115228652954},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5672276020050049},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5379780530929565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5353026986122131},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5096237659454346},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49758270382881165},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.495017945766449},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.48685401678085327},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.43672245740890503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32433027029037476},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.25499963760375977},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.168808251619339},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1536698043346405}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/palgrave.jors.2601821","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601821","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:56:y:2005:i:4:d:10.1057_palgrave.jors.2601821","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601821","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1591968161","https://openalex.org/W1963802054","https://openalex.org/W1965680834","https://openalex.org/W1982512167","https://openalex.org/W1986201860","https://openalex.org/W2008229997","https://openalex.org/W2017697298","https://openalex.org/W2017927472","https://openalex.org/W2023571729","https://openalex.org/W2032789430","https://openalex.org/W2042492403","https://openalex.org/W2110105948","https://openalex.org/W2111415774","https://openalex.org/W2138304862","https://openalex.org/W2140036008","https://openalex.org/W2145457833","https://openalex.org/W2151339549","https://openalex.org/W2172255557","https://openalex.org/W2610052675"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W1561849181","https://openalex.org/W4380840098","https://openalex.org/W2387385213","https://openalex.org/W2059360098","https://openalex.org/W2418231958","https://openalex.org/W88291963","https://openalex.org/W2048177396","https://openalex.org/W3081212354"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,15],"exact":[3],"algorithm":[4,89],"for":[5],"solving":[6],"the":[7,23,45,94,97,123],"generalized":[8],"minimum":[9,51,81],"spanning":[10,33,52,83],"tree":[11,53,84],"problem":[12,27,54],"(GMST).":[13],"Given":[14],"undirected":[16],"connected":[17],"graph":[18,24],"and":[19,58,117],"a":[20,30,50,62,72,79,102],"partition":[21],"of":[22,39,96,105],"vertices,":[25,114],"this":[26,43],"requires":[28],"finding":[29],"least-cost":[31],"subgraph":[32],"at":[34],"least":[35],"one":[36],"vertex":[37],"out":[38],"every":[40],"subset.":[41],"In":[42],"paper,":[44],"GMST":[46],"is":[47,90,127],"formulated":[48],"as":[49,110,112],"with":[55,109],"side":[56],"constraints":[57,76],"solved":[59],"exactly":[60],"by":[61,69],"branch-and-bound":[63],"algorithm.":[64],"Lower":[65],"bounds":[66],"are":[67],"derived":[68],"relaxing,":[70],"in":[71],"Lagrangian":[73],"fashion,":[74],"complicating":[75],"to":[77,92],"yield":[78],"modified":[80],"cost":[82],"problem.":[85,98],"An":[86],"efficient":[87],"preprocessing":[88],"implemented":[91],"reduce":[93],"size":[95],"Computational":[99],"tests":[100],"on":[101],"large":[103],"set":[104],"randomly":[106],"generated":[107],"instances":[108],"many":[111],"250":[113],"1000":[115],"edges,":[116],"25":[118],"subsets":[119],"provide":[120],"evidence":[121],"that":[122],"proposed":[124],"solution":[125],"approach":[126],"very":[128],"effective.":[129]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}