{"id":"https://openalex.org/W2108123796","doi":"https://doi.org/10.1504/ijkesdp.2010.035908","title":"An approximate solution method based on tabu search for k-minimum spanning tree problems","display_name":"An approximate solution method based on tabu search for k-minimum spanning tree problems","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2108123796","doi":"https://doi.org/10.1504/ijkesdp.2010.035908","mag":"2108123796"},"language":"en","primary_location":{"id":"doi:10.1504/ijkesdp.2010.035908","doi":"https://doi.org/10.1504/ijkesdp.2010.035908","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijkesdp.2010.035908","pdf_url":null,"source":{"id":"https://openalex.org/S21495196","display_name":"International Journal of Knowledge Engineering and Soft Data Paradigms","issn_l":"1755-3210","issn":["1755-3210","1755-3229"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Knowledge Engineering and Soft Data Paradigms","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/A5049549581","display_name":"Hideki Katagiri","orcid":"https://orcid.org/0000-0002-3627-8093","observed_orcids":["https://orcid.org/0000-0002-3627-8093"]},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hideki Katagiri","raw_affiliation_strings":["Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037043794","display_name":"Tomohiro Hayashida","orcid":"https://orcid.org/0000-0003-4476-7468","observed_orcids":["https://orcid.org/0000-0003-4476-7468"]},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomohiro Hayashida","raw_affiliation_strings":["Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039158867","display_name":"Ichiro Nishizaki","orcid":"https://orcid.org/0000-0002-0060-4360","observed_orcids":["https://orcid.org/0000-0002-0060-4360"]},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ichiro Nishizaki","raw_affiliation_strings":["Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028987652","display_name":"Jun Ishimatsu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jun Ishimatsu","raw_affiliation_strings":["Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":null,"apc_paid":null,"fwci":1.6438,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83986641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":"3","first_page":"263","last_page":"263"},"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.8140000104904175,"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.8140000104904175,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.13950000703334808,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.025200000032782555,"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/tabu-search","display_name":"tabu search","score":0.9549999833106995},{"id":"https://openalex.org/keywords/approximate-solution-algorithm","display_name":"approximate solution algorithm","score":0.7889999747276306},{"id":"https://openalex.org/keywords/locally-optimal-solutions","display_name":"locally optimal solutions","score":0.781000018119812},{"id":"https://openalex.org/keywords/dense-graphs","display_name":"dense graphs","score":0.9580000042915344},{"id":"https://openalex.org/keywords/spanning-tree-problem","display_name":"spanning tree problem","score":0.4749999940395355}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8489070534706116},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.762184202671051},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7257828116416931},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.7088364958763123},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6131189465522766},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5916501879692078},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5449705123901367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5101854801177979},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.4471922218799591},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44630664587020874},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.43438631296157837},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4315285086631775},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4314899146556854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4235486090183258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42352694272994995},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.22960424423217773},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14499664306640625},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1385103464126587},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.135442316532135},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1271946132183075},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.08367988467216492}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijkesdp.2010.035908","doi":"https://doi.org/10.1504/ijkesdp.2010.035908","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijkesdp.2010.035908","pdf_url":null,"source":{"id":"https://openalex.org/S21495196","display_name":"International Journal of Knowledge Engineering and Soft Data Paradigms","issn_l":"1755-3210","issn":["1755-3210","1755-3229"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Knowledge Engineering and Soft Data Paradigms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4943999946117401,"display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1537901463","https://openalex.org/W1590145340","https://openalex.org/W1976222519","https://openalex.org/W2010334716","https://openalex.org/W2010597367","https://openalex.org/W2034256646","https://openalex.org/W2045734922","https://openalex.org/W2120314696","https://openalex.org/W2147258429","https://openalex.org/W2339500526","https://openalex.org/W2804821234"],"related_works":["https://openalex.org/W1601702010","https://openalex.org/W2415357887","https://openalex.org/W3135682493","https://openalex.org/W2948290850","https://openalex.org/W4390460200","https://openalex.org/W204234221","https://openalex.org/W2237936518","https://openalex.org/W1998129800","https://openalex.org/W2032389500","https://openalex.org/W7098629376"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"a":[3,46],"new":[4],"tabu":[5],"search-based":[6],"approximate":[7],"solution":[8,56],"algorithm":[9,22],"for":[10,50],"k-minimum":[11],"spanning":[12,34],"tree":[13,35],"problems.":[14],"One":[15],"of":[16,19,55],"the":[17,20,42],"features":[18],"proposed":[21,43],"is":[23],"that":[24,41],"it":[25],"efficiently":[26],"obtains":[27],"local":[28],"optimal":[29],"solutions":[30],"without":[31],"applying":[32],"minimum":[33],"algorithms.":[36,60],"Numerical":[37],"experimental":[38],"results":[39],"show":[40],"method":[44],"provides":[45],"good":[47],"performance":[48],"especially":[49],"dense":[51],"graphs":[52],"in":[53],"terms":[54],"accuracy":[57],"over":[58],"existing":[59]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}