{"id":"https://openalex.org/W1991573370","doi":"https://doi.org/10.1002/1097-0037(200009)36:2<138::aid-net9>3.0.co;2-u","title":"Tabu search for the Steiner problem in graphs","display_name":"Tabu search for the Steiner problem in graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1991573370","doi":"https://doi.org/10.1002/1097-0037(200009)36:2<138::aid-net9>3.0.co;2-u","mag":"1991573370"},"language":"en","primary_location":{"id":"doi:10.1002/1097-0037(200009)36:2<138::aid-net9>3.0.co;2-u","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0037(200009)36:2<138::aid-net9>3.0.co;2-u","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/I84470341","display_name":"Catholic University of America","ror":"https://ror.org/047yk3s18","country_code":"US","type":"education","lineage":["https://openalex.org/I84470341"]},{"id":"https://openalex.org/I2699952","display_name":"Pontifical Catholic University of Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]}],"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/I84470341","display_name":"Catholic University of America","ror":"https://ror.org/047yk3s18","country_code":"US","type":"education","lineage":["https://openalex.org/I84470341"]},{"id":"https://openalex.org/I2699952","display_name":"Pontifical Catholic University of Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]}],"countries":["BR","US"],"is_corresponding":false,"raw_author_name":"Maur\ufffdcio C. De Souza","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"]}]}],"institutions":[],"countries_distinct_count":2,"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":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":4.0473,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.9322728,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"2","first_page":"138","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9599000215530396,"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.9495999813079834,"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.8998777866363525},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7879354953765869},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6919951438903809},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.522087037563324},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5101338028907776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5067113041877747},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5066388249397278},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47560033202171326},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45822370052337646},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4537340998649597},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44426077604293823},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.41741132736206055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4156220555305481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3896012008190155},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.1651783585548401}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8998777866363525},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7879354953765869},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6919951438903809},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.522087037563324},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5101338028907776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5067113041877747},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5066388249397278},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47560033202171326},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45822370052337646},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4537340998649597},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44426077604293823},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.41741132736206055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4156220555305481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3896012008190155},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.1651783585548401},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/1097-0037(200009)36:2<138::aid-net9>3.0.co;2-u","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0037(200009)36:2<138::aid-net9>3.0.co;2-u","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W163762979","https://openalex.org/W430464544","https://openalex.org/W1005876121","https://openalex.org/W1483673511","https://openalex.org/W1531162979","https://openalex.org/W1545925697","https://openalex.org/W1588351583","https://openalex.org/W1967744114","https://openalex.org/W1975290397","https://openalex.org/W2017927472","https://openalex.org/W2019357066","https://openalex.org/W2049967755","https://openalex.org/W2058600255","https://openalex.org/W2063395464","https://openalex.org/W2071845176","https://openalex.org/W2096904152","https://openalex.org/W2115036101","https://openalex.org/W2117937654","https://openalex.org/W2118720660","https://openalex.org/W2163210218","https://openalex.org/W2172222998","https://openalex.org/W2275351491","https://openalex.org/W2401610261","https://openalex.org/W2575995598","https://openalex.org/W2586554544","https://openalex.org/W6607985343"],"related_works":["https://openalex.org/W1970145791","https://openalex.org/W2900469667","https://openalex.org/W3131610618","https://openalex.org/W306252662","https://openalex.org/W2174077876","https://openalex.org/W1511480398","https://openalex.org/W4242473996","https://openalex.org/W1991925252","https://openalex.org/W3187836939","https://openalex.org/W2156098341"],"abstract_inverted_index":{"Given":[0],"an":[1],"undirected":[2],"graph":[3],"with":[4,7,79,104],"weights":[5],"associated":[6],"its":[8],"edges,":[9],"the":[10,28,41,70,96,99,110],"Steiner":[11,42,56],"tree":[12],"problem":[13,43],"consists":[14],"of":[15,24,27,55,85,98,106,120],"finding":[16],"a":[17,21,36,48,75],"minimum-weighted":[18],"subgraph":[19],"spanning":[20],"given":[22],"subset":[23],"nodes":[25],"(terminals)":[26],"original":[29],"graph.":[30],"In":[31],"this":[32],"paper,":[33],"we":[34],"describe":[35],"tabu":[37,101],"search":[38,102,113],"algorithm":[39,78,103],"for":[40],"in":[44,83,118],"graphs,":[45],"based":[46],"on":[47,90],"neighborhood":[49],"defined":[50],"by":[51],"insertions":[52],"and":[53,62],"eliminations":[54],"nodes.":[57],"Move":[58],"estimations,":[59],"elimination":[60],"tests,":[61],"neighborhood-reduction":[63],"techniques":[64],"are":[65,93],"used":[66],"to":[67,74],"speed":[68],"up":[69],"local":[71],"search,":[72],"leading":[73],"very":[76,80],"fast":[77],"good":[81],"results":[82],"terms":[84,119],"solution":[86],"quality.":[87],"Computational":[88],"experiments":[89],"benchmark":[91],"problems":[92],"reported,":[94],"comparing":[95],"behavior":[97],"proposed":[100],"that":[105],"other":[107,116],"heuristics":[108,117],"from":[109],"literature.":[111],"Tabu":[112],"clearly":[114],"outperforms":[115],"computation":[121],"times,":[122],"obtaining":[123],"better":[124],"or":[125],"comparable":[126],"solutions.":[127],"\u00a9":[128],"2000":[129],"John":[130],"Wiley":[131],"&":[132],"Sons,":[133],"Inc.":[134]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}