{"id":"https://openalex.org/W3091103485","doi":"https://doi.org/10.1007/978-3-030-58942-4_29","title":"Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH","display_name":"Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3091103485","doi":"https://doi.org/10.1007/978-3-030-58942-4_29","mag":"3091103485"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-58942-4_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-58942-4_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5083349589","display_name":"Maximilian Thiessen","orcid":"https://orcid.org/0000-0001-9333-2685"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]},{"id":"https://openalex.org/I4210144576","display_name":"Fraunhofer Institute for Intelligent Analysis and Information Systems","ror":"https://ror.org/04nc32781","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210144576","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maximilian Thiessen","raw_affiliation_strings":["Department of Computer Science, University of Bonn, Bonn, Germany","Fraunhofer IAIS, Sankt Augustin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Fraunhofer IAIS, Sankt Augustin, Germany","institution_ids":["https://openalex.org/I4210144576"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102710400","display_name":"Luis Quesada","orcid":"https://orcid.org/0000-0003-3177-655X"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Luis Quesada","raw_affiliation_strings":["Insight Centre for Data Analytics, School of Computer Science and IT, University College Cork, Cork, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Insight Centre for Data Analytics, School of Computer Science and IT, University College Cork, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052508716","display_name":"Kenneth N. Brown","orcid":"https://orcid.org/0000-0003-1853-0723"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Kenneth N. Brown","raw_affiliation_strings":["Insight Centre for Data Analytics, School of Computer Science and IT, University College Cork, Cork, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Insight Centre for Data Analytics, School of Computer Science and IT, University College Cork, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22130222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"447","last_page":"456"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8210558891296387},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7665464878082275},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6216332912445068},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.601175844669342},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5664052367210388},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5639901161193848},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5267379283905029},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5259202718734741},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.49074921011924744},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.483536958694458},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4834802746772766},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4827967882156372},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.4512266218662262},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41657528281211853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38680803775787354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3446543216705322},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3075730800628662},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2852393388748169},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21946820616722107}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8210558891296387},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7665464878082275},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6216332912445068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.601175844669342},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5664052367210388},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5639901161193848},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5267379283905029},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5259202718734741},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.49074921011924744},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.483536958694458},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4834802746772766},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4827967882156372},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4512266218662262},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41657528281211853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38680803775787354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3446543216705322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3075730800628662},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2852393388748169},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21946820616722107},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-030-58942-4_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-58942-4_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:http://www.rian.ie/190922/","is_oa":false,"landing_page_url":"http://hdl.handle.net/10468/10595","pdf_url":null,"source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I115570527","host_organization_name":"Dublin Institute of Technology","host_organization_lineage":["https://openalex.org/I115570527"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thiessen, M., Quesada, L., and Brown, K.N. (2020) 'Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH', in: Hebrard E., Musliu N. (eds). Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2020, Lecture Notes in Computer Science, vol 12296, Cham: Springer International Publishing, pp. 447-456. doi: 978-3-030-58942-4","raw_type":"Book chapter"},{"id":"pmh:oai:fraunhofer.de:N-614470","is_oa":false,"landing_page_url":"http://publica.fraunhofer.de/documents/N-614470.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400801","display_name":"Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fraunhofer IAIS","raw_type":"Conference Paper"},{"id":"pmh:oai:publica.fraunhofer.de:publica/410006","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/410006","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"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":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1484903242","https://openalex.org/W1514412456","https://openalex.org/W1542480886","https://openalex.org/W1546349816","https://openalex.org/W1606316903","https://openalex.org/W1652823179","https://openalex.org/W1986237174","https://openalex.org/W1996357025","https://openalex.org/W2011039300","https://openalex.org/W2011292059","https://openalex.org/W2017708378","https://openalex.org/W2042986967","https://openalex.org/W2058748455","https://openalex.org/W2068019074","https://openalex.org/W2082779900","https://openalex.org/W2089455182","https://openalex.org/W2132467327","https://openalex.org/W2140556556","https://openalex.org/W2142502714","https://openalex.org/W2148673189","https://openalex.org/W2346287856","https://openalex.org/W2768411980","https://openalex.org/W2888172571","https://openalex.org/W2913564078","https://openalex.org/W2974221591","https://openalex.org/W4245633299","https://openalex.org/W4251562717"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W4242086819","https://openalex.org/W2589768050","https://openalex.org/W2074214908","https://openalex.org/W2387385213","https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3016811403","https://openalex.org/W2138987445","https://openalex.org/W2943635264"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}