{"id":"https://openalex.org/W4291237230","doi":"https://doi.org/10.1007/s11590-022-01918-1","title":"General variable neighborhood search for the minimum stretch spanning tree problem","display_name":"General variable neighborhood search for the minimum stretch spanning tree problem","publication_year":2022,"publication_date":"2022-08-13","ids":{"openalex":"https://openalex.org/W4291237230","doi":"https://doi.org/10.1007/s11590-022-01918-1"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-022-01918-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-022-01918-1","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","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/A5030477911","display_name":"Yogita Singh Kardam","orcid":null},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Yogita Singh Kardam","raw_affiliation_strings":["Department of Mathematics, Dayalbagh Educational Institute, Agra, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Dayalbagh Educational Institute, Agra, India","institution_ids":["https://openalex.org/I178254495"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024615863","display_name":"Kamal Srivastava","orcid":"https://orcid.org/0009-0006-8125-6332"},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kamal Srivastava","raw_affiliation_strings":["Department of Mathematics, Dayalbagh Educational Institute, Agra, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Dayalbagh Educational Institute, Agra, India","institution_ids":["https://openalex.org/I178254495"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031462168","display_name":"Rafael Mart\u0131\u0301","orcid":"https://orcid.org/0000-0001-7265-823X"},"institutions":[{"id":"https://openalex.org/I16097986","display_name":"Universitat de Val\u00e8ncia","ror":"https://ror.org/043nxc105","country_code":"ES","type":"education","lineage":["https://openalex.org/I16097986"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Rafael Mart\u00ed","raw_affiliation_strings":["Department of Statistics and Operations Research, University of Valencia, Valencia, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Valencia, Valencia, Spain","institution_ids":["https://openalex.org/I16097986"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030477911"],"corresponding_institution_ids":["https://openalex.org/I178254495"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.541,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71334107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"9","first_page":"2005","last_page":"2031"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9836999773979187,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9707000255584717,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6758623719215393},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6209170818328857},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6113830804824829},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.565852165222168},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5595568418502808},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5581938624382019},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.543124794960022},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.5121719837188721},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4573819041252136},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43345212936401367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4241466522216797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31430351734161377},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2955123782157898},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23538890480995178},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2340134084224701},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.211149662733078}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6758623719215393},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6209170818328857},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6113830804824829},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.565852165222168},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5595568418502808},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5581938624382019},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.543124794960022},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.5121719837188721},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4573819041252136},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43345212936401367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4241466522216797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31430351734161377},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2955123782157898},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23538890480995178},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2340134084224701},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.211149662733078}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-022-01918-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-022-01918-1","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G4408282626","display_name":null,"funder_award_id":"RGNF fellowship ID- [RGNF-2014-15-SC-UTT-74975]","funder_id":"https://openalex.org/F4320320767","funder_display_name":"University Grants Commission"}],"funders":[{"id":"https://openalex.org/F4320320767","display_name":"University Grants Commission","ror":"https://ror.org/04p800546"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1966931974","https://openalex.org/W1973029334","https://openalex.org/W1997205866","https://openalex.org/W2010334716","https://openalex.org/W2018963243","https://openalex.org/W2019347980","https://openalex.org/W2065889331","https://openalex.org/W2091569826","https://openalex.org/W2205533919","https://openalex.org/W2276605036","https://openalex.org/W2516530272","https://openalex.org/W2590614448","https://openalex.org/W2741657924","https://openalex.org/W2766939754","https://openalex.org/W2897842022","https://openalex.org/W2912257407","https://openalex.org/W2955720331","https://openalex.org/W3024713436","https://openalex.org/W3041408219","https://openalex.org/W3075386639","https://openalex.org/W3116284897","https://openalex.org/W3141776272","https://openalex.org/W4237698051","https://openalex.org/W4246219036","https://openalex.org/W4289694552","https://openalex.org/W4302604684","https://openalex.org/W6600753396"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2387385213","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W2138987445","https://openalex.org/W1842018596","https://openalex.org/W4302939663"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}