{"id":"https://openalex.org/W2095463189","doi":"https://doi.org/10.1007/s10878-013-9622-z","title":"A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem","display_name":"A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem","publication_year":2013,"publication_date":"2013-05-16","ids":{"openalex":"https://openalex.org/W2095463189","doi":"https://doi.org/10.1007/s10878-013-9622-z","mag":"2095463189"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-013-9622-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-013-9622-z","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5069188671","display_name":"Theodoros P. Gevezes","orcid":null},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Theodoros Gevezes","raw_affiliation_strings":["Department of Mathematical, Physical and Computational Sciences, Aristotle University of Thessaloniki, 54124 , Thessaloniki, Greece","Department of Mathematical, Physical and Computational Sciences, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical, Physical and Computational Sciences, Aristotle University of Thessaloniki, 54124 , Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]},{"raw_affiliation_string":"Department of Mathematical, Physical and Computational Sciences, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124#TAB#","institution_ids":["https://openalex.org/I21370196"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029687251","display_name":"Leonidas Pitsoulis","orcid":null},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Leonidas Pitsoulis","raw_affiliation_strings":["Department of Mathematical, Physical and Computational Sciences, Aristotle University of Thessaloniki, 54124 , Thessaloniki, Greece","Department of Mathematical, Physical and Computational Sciences, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical, Physical and Computational Sciences, Aristotle University of Thessaloniki, 54124 , Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]},{"raw_affiliation_string":"Department of Mathematical, Physical and Computational Sciences, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124#TAB#","institution_ids":["https://openalex.org/I21370196"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069188671"],"corresponding_institution_ids":["https://openalex.org/I21370196"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.4885,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.90666879,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"29","issue":"4","first_page":"859","last_page":"883"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/theory-of-computation","display_name":"Theory of computation","score":0.6973791122436523},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.680526852607727},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.589179515838623},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5678619146347046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5398563146591187},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5348934531211853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5317159295082092},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.4748922884464264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40280774235725403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3226533532142639},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3029504418373108},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1728166937828064}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6973791122436523},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.680526852607727},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.589179515838623},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5678619146347046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5398563146591187},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5348934531211853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5317159295082092},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.4748922884464264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40280774235725403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3226533532142639},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3029504418373108},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1728166937828064},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-013-9622-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-013-9622-z","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9622-z","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-013-9622-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321038","display_name":"Fonds National de la Recherche Luxembourg","ror":"https://ror.org/039z13y21"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W595785050","https://openalex.org/W1482447760","https://openalex.org/W1486115220","https://openalex.org/W1486125668","https://openalex.org/W1488861257","https://openalex.org/W1498309122","https://openalex.org/W1501313444","https://openalex.org/W1534895432","https://openalex.org/W1563291122","https://openalex.org/W1563399908","https://openalex.org/W1587861032","https://openalex.org/W1588039295","https://openalex.org/W1820259117","https://openalex.org/W1986088012","https://openalex.org/W1989048084","https://openalex.org/W1997416868","https://openalex.org/W2011039300","https://openalex.org/W2022126655","https://openalex.org/W2022603493","https://openalex.org/W2022630275","https://openalex.org/W2034339630","https://openalex.org/W2036145579","https://openalex.org/W2037050365","https://openalex.org/W2049287714","https://openalex.org/W2053308011","https://openalex.org/W2076047621","https://openalex.org/W2090223576","https://openalex.org/W2090275183","https://openalex.org/W2099861483","https://openalex.org/W2101468281","https://openalex.org/W2102403605","https://openalex.org/W2111953579","https://openalex.org/W2122132398","https://openalex.org/W2134761228","https://openalex.org/W2148352980","https://openalex.org/W2149230251","https://openalex.org/W2153446897","https://openalex.org/W2154259526","https://openalex.org/W2154503441","https://openalex.org/W2167057380","https://openalex.org/W2168406421","https://openalex.org/W2339500526","https://openalex.org/W2413933131","https://openalex.org/W2886476296","https://openalex.org/W2997776631","https://openalex.org/W4212899374"],"related_works":["https://openalex.org/W2277088917","https://openalex.org/W2040147369","https://openalex.org/W4280543056","https://openalex.org/W2154172459","https://openalex.org/W2809828719","https://openalex.org/W2541760731","https://openalex.org/W2018096104","https://openalex.org/W1827895227","https://openalex.org/W2373750984","https://openalex.org/W45904909"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}