{"id":"https://openalex.org/W3028401056","doi":"https://doi.org/10.1007/s10878-021-00835-w","title":"Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem","display_name":"Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem","publication_year":2022,"publication_date":"2022-01-10","ids":{"openalex":"https://openalex.org/W3028401056","doi":"https://doi.org/10.1007/s10878-021-00835-w","mag":"3028401056"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-021-00835-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-021-00835-w","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","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/A5014333403","display_name":"Alexandre Salles da Cunha","orcid":"https://orcid.org/0000-0002-9955-5721"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Alexandre Salles da Cunha","raw_affiliation_strings":["Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014333403"],"corresponding_institution_ids":["https://openalex.org/I110200422"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.1353,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48531532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"44","issue":"1","first_page":"379","last_page":"413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9984999895095825,"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.9984999895095825,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9703999757766724,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7943614721298218},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7252581119537354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7065256834030151},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.630652904510498},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6251031160354614},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6009384989738464},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5636810064315796},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.48246294260025024},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.48052629828453064},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4787294566631317},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4442518353462219},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.43292102217674255},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41329607367515564},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40323108434677124},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.3409993648529053},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3160948157310486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26880908012390137},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11658069491386414}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7943614721298218},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7252581119537354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7065256834030151},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.630652904510498},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6251031160354614},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6009384989738464},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5636810064315796},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.48246294260025024},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.48052629828453064},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4787294566631317},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4442518353462219},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.43292102217674255},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41329607367515564},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40323108434677124},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.3409993648529053},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3160948157310486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26880908012390137},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11658069491386414}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-021-00835-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-021-00835-w","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00835-w","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-021-00835-w","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":[{"id":"https://openalex.org/G1570138624","display_name":null,"funder_award_id":"CEX - PPM-00164/17","funder_id":"https://openalex.org/F4320322980","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais"},{"id":"https://openalex.org/G3894400641","display_name":null,"funder_award_id":"303928/2018-2","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320322980","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","ror":"https://ror.org/00nc55f03"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1701561229","https://openalex.org/W1747465883","https://openalex.org/W1774950136","https://openalex.org/W1833772674","https://openalex.org/W1991528957","https://openalex.org/W2006934540","https://openalex.org/W2009782889","https://openalex.org/W2041754841","https://openalex.org/W2051450977","https://openalex.org/W2060388851","https://openalex.org/W2075339720","https://openalex.org/W2084142581","https://openalex.org/W2084386340","https://openalex.org/W2112802532","https://openalex.org/W2121633935","https://openalex.org/W2149454052","https://openalex.org/W2163428398","https://openalex.org/W2167455614","https://openalex.org/W2601960767","https://openalex.org/W2969918324","https://openalex.org/W2993197632"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W4252122881","https://openalex.org/W1531708257","https://openalex.org/W2171830873","https://openalex.org/W2593343445","https://openalex.org/W2979654979","https://openalex.org/W2769220156","https://openalex.org/W2903252607","https://openalex.org/W2154089325","https://openalex.org/W2807981612"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}