{"id":"https://openalex.org/W2222125267","doi":"https://doi.org/10.1007/978-0-387-30165-5_19","title":"On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem","display_name":"On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem","publication_year":2008,"publication_date":"2008-12-09","ids":{"openalex":"https://openalex.org/W2222125267","doi":"https://doi.org/10.1007/978-0-387-30165-5_19","mag":"2222125267"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-30165-5_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-0-387-30165-5_19","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Optimization in Telecommunications","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/A5045756477","display_name":"Geir Dahl","orcid":"https://orcid.org/0000-0002-7481-6382"},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Geir Dahl","raw_affiliation_strings":["Department of Mathematics and Department of Informatics, University of Oslo, 0316, Oslo, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Department of Informatics, University of Oslo, 0316, Oslo, Norway","institution_ids":["https://openalex.org/I184942183"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017238021","display_name":"Lu\u0131\u0301s Gouveia","orcid":"https://orcid.org/0000-0003-4393-1617"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Luis Gouveia","raw_affiliation_strings":["DEIO-CIO, Faculdade de Ci\u00eancias da Universidade de Lisboa, 1749-016, Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIO-CIO, Faculdade de Ci\u00eancias da Universidade de Lisboa, 1749-016, Lisboa, Portugal","institution_ids":["https://openalex.org/I141596103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010888863","display_name":"Cristina Requejo","orcid":"https://orcid.org/0000-0003-0529-5090"},"institutions":[{"id":"https://openalex.org/I60858718","display_name":"University of Aveiro","ror":"https://ror.org/00nt41z93","country_code":"PT","type":"education","lineage":["https://openalex.org/I60858718"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Cristina Requejo","raw_affiliation_strings":["University of Aveiro, 1810-193, Aveiro, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Aveiro, 1810-193, Aveiro, Portugal","institution_ids":["https://openalex.org/I60858718"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.2843,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.99403509,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"493","last_page":"515"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"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.9987000226974487,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9848999977111816,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7858289480209351},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7559115886688232},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.6701210737228394},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5889556407928467},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.5841001868247986},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5297143459320068},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5256946086883545},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.500831127166748},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.49428677558898926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45205894112586975},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.44181859493255615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4373210072517395},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.41757622361183167},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.3980705142021179},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31614843010902405},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.2134583294391632}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7858289480209351},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7559115886688232},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.6701210737228394},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5889556407928467},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.5841001868247986},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5297143459320068},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5256946086883545},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.500831127166748},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.49428677558898926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45205894112586975},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.44181859493255615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4373210072517395},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.41757622361183167},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.3980705142021179},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31614843010902405},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2134583294391632},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-0-387-30165-5_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-0-387-30165-5_19","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Optimization in Telecommunications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","display_name":"Climate action","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W56883693","https://openalex.org/W92038179","https://openalex.org/W1495472867","https://openalex.org/W1558071713","https://openalex.org/W1566753057","https://openalex.org/W1583635887","https://openalex.org/W1967079221","https://openalex.org/W1968143987","https://openalex.org/W1977545325","https://openalex.org/W1989714486","https://openalex.org/W1999578543","https://openalex.org/W2006877095","https://openalex.org/W2008771115","https://openalex.org/W2017697298","https://openalex.org/W2019067222","https://openalex.org/W2019658506","https://openalex.org/W2039611868","https://openalex.org/W2049236593","https://openalex.org/W2052035035","https://openalex.org/W2057725412","https://openalex.org/W2059690430","https://openalex.org/W2069926749","https://openalex.org/W2084863329","https://openalex.org/W2104431850","https://openalex.org/W2116059756","https://openalex.org/W2127635925","https://openalex.org/W2133150235","https://openalex.org/W2138913744","https://openalex.org/W2139211712","https://openalex.org/W2145126253","https://openalex.org/W2167906774","https://openalex.org/W2505968561","https://openalex.org/W4234408051","https://openalex.org/W4236542218","https://openalex.org/W4242130683","https://openalex.org/W6634662653","https://openalex.org/W6662665580","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W1561849181","https://openalex.org/W2059360098","https://openalex.org/W3010374802","https://openalex.org/W1569529368","https://openalex.org/W3001850742","https://openalex.org/W2477124885","https://openalex.org/W3081212354","https://openalex.org/W2527517796","https://openalex.org/W3016811403","https://openalex.org/W3116169590"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}