{"id":"https://openalex.org/W2001366300","doi":"https://doi.org/10.1155/2011/143732","title":"Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques","display_name":"Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2001366300","doi":"https://doi.org/10.1155/2011/143732","mag":"2001366300"},"language":"en","primary_location":{"id":"doi:10.1155/2011/143732","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2011/143732","pdf_url":"https://downloads.hindawi.com/journals/aor/2011/143732.pdf","source":{"id":"https://openalex.org/S33782831","display_name":"Advances in Operations Research","issn_l":"1687-9147","issn":["1687-9147","1687-9155"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://downloads.hindawi.com/journals/aor/2011/143732.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052731284","display_name":"Andreas M. Chwatal","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Andreas M. Chwatal","raw_affiliation_strings":["Institute of Computer Graphics and Algorithms, Vienna University of Technology, 1040 Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Graphics and Algorithms, Vienna University of Technology, 1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030647388","display_name":"G\u00fcnther R. Raidl","orcid":"https://orcid.org/0000-0002-3293-177X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"G\u00fcnther R. Raidl","raw_affiliation_strings":["Institute of Computer Graphics and Algorithms, Vienna University of Technology, 1040 Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Graphics and Algorithms, Vienna University of Technology, 1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052731284"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":1025,"currency":"USD","value_usd":1025},"apc_paid":{"value":1025,"currency":"USD","value_usd":1025},"fwci":3.0497,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.90773406,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2011","issue":null,"first_page":"1","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9868999719619751,"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/T11182","display_name":"Auction Theory and Applications","score":0.9728999733924866,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7943985462188721},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.710263192653656},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6766138076782227},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6765134334564209},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6648901700973511},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6449738144874573},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5770249962806702},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5415840744972229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5159252882003784},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.4694649279117584},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.44840458035469055},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.44455206394195557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.388690322637558},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28679168224334717},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1857818067073822},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10329148173332214}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7943985462188721},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.710263192653656},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6766138076782227},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6765134334564209},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6648901700973511},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6449738144874573},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5770249962806702},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5415840744972229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5159252882003784},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.4694649279117584},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44840458035469055},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.44455206394195557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.388690322637558},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28679168224334717},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1857818067073822},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10329148173332214},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1155/2011/143732","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2011/143732","pdf_url":"https://downloads.hindawi.com/journals/aor/2011/143732.pdf","source":{"id":"https://openalex.org/S33782831","display_name":"Advances in Operations Research","issn_l":"1687-9147","issn":["1687-9147","1687-9155"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:hin:jnlaor:143732","is_oa":false,"landing_page_url":"http://downloads.hindawi.com/journals/AOR/2011/143732.xml","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"},{"id":"pmh:oai:doaj.org/article:896ff5ba4e8d43cda1f9924d40da0a9b","is_oa":false,"landing_page_url":"https://doaj.org/article/896ff5ba4e8d43cda1f9924d40da0a9b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Advances in Operations Research, Vol 2011 (2011)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/2011/143732","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2011/143732","pdf_url":"https://downloads.hindawi.com/journals/aor/2011/143732.pdf","source":{"id":"https://openalex.org/S33782831","display_name":"Advances in Operations Research","issn_l":"1687-9147","issn":["1687-9147","1687-9155"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2001366300.pdf","grobid_xml":"https://content.openalex.org/works/W2001366300.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W22377767","https://openalex.org/W31709568","https://openalex.org/W90095718","https://openalex.org/W1558071713","https://openalex.org/W1968143987","https://openalex.org/W1992197964","https://openalex.org/W1997809628","https://openalex.org/W2006909611","https://openalex.org/W2038344659","https://openalex.org/W2048177396","https://openalex.org/W2049287714","https://openalex.org/W2051100691","https://openalex.org/W2066622420","https://openalex.org/W2095481180","https://openalex.org/W2100126548","https://openalex.org/W2102073566","https://openalex.org/W2103657951","https://openalex.org/W2106233376","https://openalex.org/W2117212290","https://openalex.org/W2117842753","https://openalex.org/W2152216760","https://openalex.org/W2156312014","https://openalex.org/W2161905319","https://openalex.org/W2282553325","https://openalex.org/W2964105184"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W4302819359","https://openalex.org/W2941114593","https://openalex.org/W4252122881","https://openalex.org/W1971357083","https://openalex.org/W2734758384","https://openalex.org/W3006617646","https://openalex.org/W2769538987"],"abstract_inverted_index":{"We":[0,32],"present":[1],"exact":[2],"mixed":[3],"integer":[4],"programming":[5],"approaches":[6],"including":[7],"branch-and-cut":[8],"and":[9,39,51,102,107],"branch-and-cut-and-price":[10],"for":[11],"the":[12,56,65,68,76,81,90,104,108,114],"minimum":[13],"label":[14],"spanning":[15],"tree":[16],"problem":[17],"as":[18,20],"well":[19],"a":[21,86],"variant":[22],"of":[23,89,113],"it":[24],"having":[25],"multiple":[26],"labels":[27],"assigned":[28],"to":[29,47,54,64,78,100],"each":[30],"edge.":[31],"compare":[33,101],"formulations":[34,106],"based":[35],"on":[36],"network":[37],"flows":[38],"directed":[40],"connectivity":[41],"cuts.":[42],"Further,":[43],"we":[44],"show":[45],"how":[46],"use":[48],"odd-hole":[49],"inequalities":[50,53],"additional":[52],"strengthen":[55],"formulation.":[57],"Label":[58],"variables":[59],"can":[60],"be":[61],"added":[62],"dynamically":[63],"model":[66],"in":[67,98],"pricing":[69],"step.":[70],"Primal":[71],"heuristics":[72],"are":[73,96],"incorporated":[74],"into":[75],"framework":[77],"speed":[79],"up":[80],"overall":[82,115],"solution":[83],"process.":[84],"After":[85],"polyhedral":[87],"comparison":[88],"involved":[91],"formulations,":[92],"comprehensive":[93],"computational":[94],"experiments":[95],"presented":[97],"order":[99],"evaluate":[103],"underlying":[105],"particular":[109],"algorithmic":[110],"building":[111],"blocks":[112],"branch-and-cut-":[116],"(and-price)":[117],"framework.":[118]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}