{"id":"https://openalex.org/W2063193808","doi":"https://doi.org/10.1016/s0166-218x(01)00255-4","title":"Variable neighborhood search for the degree-constrained minimum spanning tree problem","display_name":"Variable neighborhood search for the degree-constrained minimum spanning tree problem","publication_year":2002,"publication_date":"2002-04-01","ids":{"openalex":"https://openalex.org/W2063193808","doi":"https://doi.org/10.1016/s0166-218x(01)00255-4","mag":"2063193808"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(01)00255-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00255-4","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5032142322","display_name":"Celso C. Ribeiro","orcid":"https://orcid.org/0000-0002-9478-2351"},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]},{"id":"https://openalex.org/I84470341","display_name":"Catholic University of America","ror":"https://ror.org/047yk3s18","country_code":"US","type":"education","lineage":["https://openalex.org/I84470341"]}],"countries":["BR","US"],"is_corresponding":true,"raw_author_name":"Celso C. Ribeiro","raw_affiliation_strings":["Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453-900, Brazil","Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453\u2010900, Brazil"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453-900, Brazil","institution_ids":["https://openalex.org/I2699952"]},{"raw_affiliation_string":"Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453\u2010900, Brazil","institution_ids":["https://openalex.org/I84470341"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003821238","display_name":"Maur\u00edcio C. de Souza","orcid":"https://orcid.org/0000-0001-6558-958X"},"institutions":[{"id":"https://openalex.org/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]},{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]},{"id":"https://openalex.org/I4210104097","display_name":"Institut Sup\u00e9rieur d\u2019Informatique, de Mod\u00e9lisation et de leurs Applications","ror":"https://ror.org/01bv2n867","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210104097"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Maur\u0131\u0301cio C. Souza","raw_affiliation_strings":["Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation de Syst\u00e8mes, Universit\u00e9 Blaise Pascal, ISIMA, BP 125, 63173 Aubi\u00e8re Cedex, France","Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation de Syst\u00e9mes, Universit\u00e9 Blaise Pascal, ISIMA, BP 125, 63173 Aubi\u00e8re Cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation de Syst\u00e8mes, Universit\u00e9 Blaise Pascal, ISIMA, BP 125, 63173 Aubi\u00e8re Cedex, France","institution_ids":["https://openalex.org/I4210099416","https://openalex.org/I4210104097"]},{"raw_affiliation_string":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation de Syst\u00e9mes, Universit\u00e9 Blaise Pascal, ISIMA, BP 125, 63173 Aubi\u00e8re Cedex, France#TAB#","institution_ids":["https://openalex.org/I198244214"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032142322"],"corresponding_institution_ids":["https://openalex.org/I2699952","https://openalex.org/I84470341"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":8.2378,"has_fulltext":false,"cited_by_count":101,"citation_normalized_percentile":{"value":0.97369937,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"118","issue":"1-2","first_page":"43","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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.9983999729156494,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9958999752998352,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9907000064849854,"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/mathematics","display_name":"Mathematics","score":0.7879024744033813},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7569050788879395},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7411280274391174},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.635805606842041},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6306850910186768},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6274165511131287},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5344094038009644},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5247871279716492},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.511039137840271},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5008828639984131},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4528622329235077},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44984644651412964},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4148004651069641},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41448336839675903},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35500192642211914},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.22937199473381042},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.1774192750453949},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.14133545756340027},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.08881741762161255}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7879024744033813},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7569050788879395},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7411280274391174},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.635805606842041},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6306850910186768},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6274165511131287},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5344094038009644},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5247871279716492},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.511039137840271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5008828639984131},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4528622329235077},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44984644651412964},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4148004651069641},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41448336839675903},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35500192642211914},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.22937199473381042},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.1774192750453949},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.14133545756340027},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.08881741762161255},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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":2,"locations":[{"id":"doi:10.1016/s0166-218x(01)00255-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00255-4","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.1289","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.1289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-di.inf.puc-rio.br/~celso/vns-dcmst.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1545925697","https://openalex.org/W1604614651","https://openalex.org/W1948148225","https://openalex.org/W1967977254","https://openalex.org/W1971782520","https://openalex.org/W1995670816","https://openalex.org/W2010334716","https://openalex.org/W2011039300","https://openalex.org/W2017127755","https://openalex.org/W2033983963","https://openalex.org/W2048822735","https://openalex.org/W2055114648","https://openalex.org/W2090275183","https://openalex.org/W2151610140","https://openalex.org/W2417562192","https://openalex.org/W2571029112","https://openalex.org/W2997776631","https://openalex.org/W4285719527","https://openalex.org/W4300163110","https://openalex.org/W6632751009","https://openalex.org/W6636326242","https://openalex.org/W6716656544"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W2387385213","https://openalex.org/W2390742649","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W88291963","https://openalex.org/W3081212354","https://openalex.org/W2589768050","https://openalex.org/W2059360098"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}