{"id":"https://openalex.org/W158372591","doi":"https://doi.org/10.1007/978-3-642-21527-8_66","title":"A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem","display_name":"A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W158372591","doi":"https://doi.org/10.1007/978-3-642-21527-8_66","mag":"158372591"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-21527-8_66","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21527-8_66","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5032185912","display_name":"Francesco Carrabs","orcid":"https://orcid.org/0000-0003-2187-8624"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Carrabs","raw_affiliation_strings":["Department of Mathematics, University of Salerno, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Salerno, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034899414","display_name":"Raffaele Cerulli","orcid":"https://orcid.org/0000-0002-3277-6802"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Raffaele Cerulli","raw_affiliation_strings":["Department of Mathematics, University of Salerno, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Salerno, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055370413","display_name":"Monica Gentili","orcid":"https://orcid.org/0000-0003-3895-0629"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Monica Gentili","raw_affiliation_strings":["Department of Computer Science, University of Salerno, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Salerno, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048623277","display_name":"Gennaro Parlato","orcid":"https://orcid.org/0000-0002-8697-2980"},"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/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gennaro Parlato","raw_affiliation_strings":["CNRS and University Paris Diderot, Liafa, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS and University Paris Diderot, Liafa, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I204730241"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8776,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.64031541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"589","last_page":"602"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9921000003814697,"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.9921000003814697,"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.9902999997138977,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9873999953269958,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.6033328771591187},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5823836326599121},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5691505074501038},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5506951212882996},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5397831201553345},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5154939293861389},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4955683946609497},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.487559974193573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45316898822784424},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4310779869556427},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4206581711769104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3821146488189697},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36963969469070435},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3240998089313507},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2805159091949463},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.27250906825065613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2561342120170593},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17330950498580933}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6033328771591187},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5823836326599121},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5691505074501038},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5506951212882996},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5397831201553345},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5154939293861389},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4955683946609497},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.487559974193573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45316898822784424},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4310779869556427},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4206581711769104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3821146488189697},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36963969469070435},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3240998089313507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2805159091949463},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.27250906825065613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2561342120170593},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17330950498580933}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-21527-8_66","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21527-8_66","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:eprints.soton.ac.uk:272461","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.388.957","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.388.957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dipmat.unisa.it/people/carrabs/www/pdf/Tabu_FVS.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5299999713897705,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1263026946","https://openalex.org/W1512015032","https://openalex.org/W1563108031","https://openalex.org/W1991300627","https://openalex.org/W1995714897","https://openalex.org/W2002234798","https://openalex.org/W2011576340","https://openalex.org/W2024517697","https://openalex.org/W2062338515","https://openalex.org/W2072261513","https://openalex.org/W2081880478","https://openalex.org/W2083197082","https://openalex.org/W2089749235","https://openalex.org/W2137181043","https://openalex.org/W2283515028","https://openalex.org/W2339500526","https://openalex.org/W2484546394","https://openalex.org/W2505201213","https://openalex.org/W2611804663","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4212899374","https://openalex.org/W4246219036","https://openalex.org/W4246598646","https://openalex.org/W4249318479","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3003449463","https://openalex.org/W2963989216","https://openalex.org/W2804969619","https://openalex.org/W4301100693","https://openalex.org/W1537543462","https://openalex.org/W2293112721","https://openalex.org/W1491760138","https://openalex.org/W2898526288","https://openalex.org/W2607123191","https://openalex.org/W205406847"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}