{"id":"https://openalex.org/W1992432840","doi":"https://doi.org/10.1007/s11081-013-9219-5","title":"Cutting-plane-based algorithms for two branch vertices related spanning tree problems","display_name":"Cutting-plane-based algorithms for two branch vertices related spanning tree problems","publication_year":2013,"publication_date":"2013-06-06","ids":{"openalex":"https://openalex.org/W1992432840","doi":"https://doi.org/10.1007/s11081-013-9219-5","mag":"1992432840"},"language":"en","primary_location":{"id":"doi:10.1007/s11081-013-9219-5","doi":"https://doi.org/10.1007/s11081-013-9219-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11081-013-9219-5","pdf_url":null,"source":{"id":"https://openalex.org/S26994821","display_name":"Optimization and Engineering","issn_l":"1389-4420","issn":["1389-4420","1573-2924"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1"],"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 and Engineering","raw_type":"journal-article"},"volume":null,"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/A5012298521","display_name":"Andr\u00e9 Rossi","orcid":"https://orcid.org/0000-0002-3689-7185","observed_orcids":["https://orcid.org/0000-0002-3689-7185"]},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2802204017","display_name":"Universit\u00e9 de Bretagne Sud","ror":"https://ror.org/04ed7fw48","country_code":"FR","type":"education","lineage":["https://openalex.org/I2802204017"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Andr\u00e9 Rossi","raw_affiliation_strings":["Lab-STICC, CNRS, Universit\u00e9 de Bretagne-Sud, B.P. 92116, 56321, Lorient Cedex, France","(Universit\u00e9 de Bretagne Sud"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lab-STICC, CNRS, Universit\u00e9 de Bretagne-Sud, B.P. 92116, 56321, Lorient Cedex, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2802204017"]},{"raw_affiliation_string":"(Universit\u00e9 de Bretagne Sud","institution_ids":["https://openalex.org/I2802204017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045783983","display_name":"Alok Pratap Singh","orcid":"https://orcid.org/0000-0003-3585-4957","observed_orcids":["https://orcid.org/0000-0003-3585-4957"]},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Alok Singh","raw_affiliation_strings":["Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India","University of hyderabad"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India","institution_ids":["https://openalex.org/I36893310"]},{"raw_affiliation_string":"University of hyderabad","institution_ids":["https://openalex.org/I36893310"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042284939","display_name":"Shyam Sundar","orcid":"https://orcid.org/0000-0001-9679-0892","observed_orcids":["https://orcid.org/0000-0001-9679-0892"]},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shyam Sundar","raw_affiliation_strings":["Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India","University of hyderabad"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India","institution_ids":["https://openalex.org/I36893310"]},{"raw_affiliation_string":"University of hyderabad","institution_ids":["https://openalex.org/I36893310"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012298521"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2802204017"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":null,"fwci":0.7239,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.71590153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"4","first_page":"855","last_page":"887"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0008999999845400453,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree-problem","display_name":"spanning tree problem","score":0.7689999938011169},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.8690000176429749},{"id":"https://openalex.org/keywords/integer-linear-programming-model","display_name":"integer linear programming formulation","score":0.8330000042915344},{"id":"https://openalex.org/keywords/multicast","display_name":"multicast","score":0.8069999814033508},{"id":"https://openalex.org/keywords/repair-function","display_name":"repair function","score":0.8429999947547913},{"id":"https://openalex.org/keywords/tabu-search","display_name":"tabu search","score":0.9120000004768372},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.703000009059906}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7474042773246765},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.700394332408905},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5969483852386475},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.574529767036438},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.565998375415802},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5589675307273865},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5405020713806152},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5394843816757202},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49706223607063293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4919573962688446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4789572060108185},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.4788539409637451},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4777181148529053},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4416525661945343},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43806013464927673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42880746722221375},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.41294461488723755},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40884411334991455},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3417865037918091},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3032631278038025},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2849538028240204},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21648693084716797},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.19272565841674805},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.09475401043891907},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s11081-013-9219-5","doi":"https://doi.org/10.1007/s11081-013-9219-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11081-013-9219-5","pdf_url":null,"source":{"id":"https://openalex.org/S26994821","display_name":"Optimization and Engineering","issn_l":"1389-4420","issn":["1389-4420","1573-2924"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1"],"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 and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00871855v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-00871855","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization and Engineering, 2014, 15 (4), pp.855-887. ⟨10.1007/s11081-013-9219-5⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W195014378","https://openalex.org/W200793886","https://openalex.org/W1488422606","https://openalex.org/W1533818411","https://openalex.org/W1570584007","https://openalex.org/W1571087346","https://openalex.org/W1588423454","https://openalex.org/W1964554834","https://openalex.org/W1971367602","https://openalex.org/W1986398633","https://openalex.org/W1991300627","https://openalex.org/W2002872142","https://openalex.org/W2013530391","https://openalex.org/W2025694459","https://openalex.org/W2052435807","https://openalex.org/W2056344222","https://openalex.org/W2062706124","https://openalex.org/W2085379263","https://openalex.org/W2090108691","https://openalex.org/W2095955498","https://openalex.org/W2096938240","https://openalex.org/W2111388000","https://openalex.org/W2133137640","https://openalex.org/W2336259629","https://openalex.org/W2339500526","https://openalex.org/W2506108511","https://openalex.org/W2561675875","https://openalex.org/W4212899374"],"related_works":["https://openalex.org/W2060095317","https://openalex.org/W2550142813","https://openalex.org/W2041365558","https://openalex.org/W7099456053","https://openalex.org/W2262627570","https://openalex.org/W1588423454","https://openalex.org/W2612502174","https://openalex.org/W2240396129","https://openalex.org/W3093456864","https://openalex.org/W7163009238"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}