{"id":"https://openalex.org/W252468355","doi":"https://doi.org/10.1007/s101070100234","title":"Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem","display_name":"Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem","publication_year":2001,"publication_date":"2001-10-01","ids":{"openalex":"https://openalex.org/W252468355","doi":"https://doi.org/10.1007/s101070100234","mag":"252468355"},"language":"en","primary_location":{"id":"doi:10.1007/s101070100234","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070100234","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5106764134","display_name":"Ravindra K. Ahuja","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravindra K. Ahuja","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA, e-mail: ahuja@ufl.edu, , , , , , US","Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA, e-mail: ahuja@ufl.edu, , US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA, e-mail: ahuja@ufl.edu, , , , , , US","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA, e-mail: ahuja@ufl.edu, , US","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, e-mail: jorlin@mit.edu, , , , , , US","Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, e-mail: jorlin@mit.edu, , US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, e-mail: jorlin@mit.edu, , , , , , US","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, e-mail: jorlin@mit.edu, , US","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108774400","display_name":"Dushyant Sharma","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dushyant Sharma","raw_affiliation_strings":["Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, e-mail: dushyant@mit.edu, , , , , , US","Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, e-mail: dushyant@mit.edu, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, e-mail: dushyant@mit.edu, , , , , , US","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, e-mail: dushyant@mit.edu, US","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":22.5183,"has_fulltext":false,"cited_by_count":148,"citation_normalized_percentile":{"value":0.99599105,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"91","issue":"1","first_page":"71","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9988999962806702,"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.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9879000186920166,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6116567850112915},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5461359024047852},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.541172981262207},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5228527188301086},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5037712454795837},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4527398347854614},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4516519606113434},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44216012954711914},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39895379543304443},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3410334289073944}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6116567850112915},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5461359024047852},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.541172981262207},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5228527188301086},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5037712454795837},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4527398347854614},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4516519606113434},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44216012954711914},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39895379543304443},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3410334289073944},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s101070100234","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070100234","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.1838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.1838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/jorlin/www/papersfolder/CMST.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5600000023841858,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W165672800","https://openalex.org/W1484547884","https://openalex.org/W1486115220","https://openalex.org/W1937463903","https://openalex.org/W1965471351","https://openalex.org/W1977545325","https://openalex.org/W2006935476","https://openalex.org/W2017927472","https://openalex.org/W2027278505","https://openalex.org/W2052862856","https://openalex.org/W2060400398","https://openalex.org/W2064806410","https://openalex.org/W2068160741","https://openalex.org/W2084863329","https://openalex.org/W2090275183","https://openalex.org/W2092674712","https://openalex.org/W2104670598","https://openalex.org/W2138913744","https://openalex.org/W2165387188","https://openalex.org/W2207378191","https://openalex.org/W2339500526"],"related_works":["https://openalex.org/W4302055381","https://openalex.org/W4312159861","https://openalex.org/W4301484659","https://openalex.org/W2338192490","https://openalex.org/W2157421865","https://openalex.org/W2180567355","https://openalex.org/W2069230977","https://openalex.org/W1978344479","https://openalex.org/W1991082127","https://openalex.org/W1494675886"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}