{"id":"https://openalex.org/W4392798754","doi":"https://doi.org/10.1145/3638584.3638607","title":"Some General Heuristics in the Traveling Salesman Problem and the Problem of Reconstructing the DNA Chain Distance Matrix","display_name":"Some General Heuristics in the Traveling Salesman Problem and the Problem of Reconstructing the DNA Chain Distance Matrix","publication_year":2023,"publication_date":"2023-12-08","ids":{"openalex":"https://openalex.org/W4392798754","doi":"https://doi.org/10.1145/3638584.3638607"},"language":"en","primary_location":{"id":"doi:10.1145/3638584.3638607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3638584.3638607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3638584.3638607","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3638584.3638607","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025751846","display_name":"Boris Melnikov","orcid":"https://orcid.org/0000-0002-6765-6800"},"institutions":[{"id":"https://openalex.org/I180726961","display_name":"Shenzhen University","ror":"https://ror.org/01vy4gh70","country_code":"CN","type":"education","lineage":["https://openalex.org/I180726961"]},{"id":"https://openalex.org/I4388482657","display_name":"Shenzhen MSU-BIT University","ror":"https://ror.org/02q963474","country_code":null,"type":"education","lineage":["https://openalex.org/I4388482657"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Boris F. Melnikov","raw_affiliation_strings":["Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, China"],"raw_orcid":"https://orcid.org/0000-0002-6765-6800","affiliations":[{"raw_affiliation_string":"Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, China","institution_ids":["https://openalex.org/I180726961","https://openalex.org/I4388482657"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047561622","display_name":"Dmitrii Chaikovskii","orcid":"https://orcid.org/0000-0002-0063-106X"},"institutions":[{"id":"https://openalex.org/I180726961","display_name":"Shenzhen University","ror":"https://ror.org/01vy4gh70","country_code":"CN","type":"education","lineage":["https://openalex.org/I180726961"]},{"id":"https://openalex.org/I4388482657","display_name":"Shenzhen MSU-BIT University","ror":"https://ror.org/02q963474","country_code":null,"type":"education","lineage":["https://openalex.org/I4388482657"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dmitrii Chaikovskii","raw_affiliation_strings":["Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, China"],"raw_orcid":"https://orcid.org/0000-0002-0063-106X","affiliations":[{"raw_affiliation_string":"Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, China","institution_ids":["https://openalex.org/I180726961","https://openalex.org/I4388482657"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025751846"],"corresponding_institution_ids":["https://openalex.org/I180726961","https://openalex.org/I4388482657"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21258224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"361","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9993000030517578,"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/T12029","display_name":"DNA and Biological Computing","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9197491407394409},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7863191366195679},{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.6071191430091858},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.540205717086792},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5397113561630249},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5248453617095947},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5197705626487732},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3687739074230194},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35648539662361145},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.354134202003479},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35256850719451904},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09028050303459167},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.06416302919387817}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9197491407394409},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7863191366195679},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.6071191430091858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.540205717086792},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5397113561630249},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5248453617095947},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5197705626487732},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3687739074230194},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35648539662361145},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.354134202003479},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35256850719451904},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09028050303459167},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.06416302919387817},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3638584.3638607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3638584.3638607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3638584.3638607","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3638584.3638607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3638584.3638607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3638584.3638607","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4392798754.pdf"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W2753081221","https://openalex.org/W2763148304","https://openalex.org/W2893594819","https://openalex.org/W2992252352"],"related_works":["https://openalex.org/W2031913815","https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143","https://openalex.org/W2073288620","https://openalex.org/W2356976268"],"abstract_inverted_index":{"With":[0],"all":[1],"their":[2],"differences,":[3],"the":[4,10,15,19,34,92,102],"two":[5],"problems":[6,38,51],"under":[7],"consideration,":[8],"namely":[9],"traveling":[11],"salesman":[12],"problem":[13,16],"and":[14,39,70],"of":[17,43,64],"restoring":[18],"DNA":[20],"chain":[21],"distance":[22],"matrix,":[23],"have":[24],"a":[25],"lot":[26],"in":[27,33,57,101],"common.":[28],"This":[29],"generality":[30],"primarily":[31],"consists":[32],"following.":[35],"For":[36],"real":[37],"for":[40,84,91],"standard":[41],"methods":[42],"solving":[44],"them,":[45,78],"such":[46,99],"as":[47],"gradient":[48],"descent,":[49],"these":[50],"can":[52],"be":[53],"formally":[54],"solved,":[55],"but":[56],"fact":[58],"they":[59],"are":[60,105],"described":[61],"by":[62],"systems":[63],"equations":[65],"with":[66],"several":[67],"dozen":[68],"variables,":[69],"sometimes":[71,87],"hundreds.":[72],"In":[73],"this":[74],"regard,":[75],"to":[76],"solve":[77],"we":[79,104],"use":[80],"sequential":[81],"algorithms":[82],"(step-by-step)":[83],"filling":[85],"matrices,":[86],"also":[88],"using":[89],"backtracking":[90],"variables":[93],"already":[94],"considered.":[95],"We":[96],"show":[97],"that":[98],"heuristics":[100],"situations":[103],"considering":[106],"give":[107],"acceptable":[108],"anytime":[109],"algorithms.":[110]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}