{"id":"https://openalex.org/W7134248213","doi":"https://doi.org/10.1016/j.cor.2026.107443","title":"A speed-up for Helsgaun\u2019s TSP heuristic by relaxing the positive gain criterion","display_name":"A speed-up for Helsgaun\u2019s TSP heuristic by relaxing the positive gain criterion","publication_year":2026,"publication_date":"2026-03-09","ids":{"openalex":"https://openalex.org/W7134248213","doi":"https://doi.org/10.1016/j.cor.2026.107443"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2026.107443","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107443","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5092574783","display_name":"Sabrina C.L. Ammann","orcid":null},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sabrina C.L. Ammann","raw_affiliation_strings":["Technische Universit\u00e4t Braunschweig, Institut f\u00fcr Mathematische Optimierung, Universit\u00e4tsplatz 2, Braunschweig, 38106, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Braunschweig, Institut f\u00fcr Mathematische Optimierung, Universit\u00e4tsplatz 2, Braunschweig, 38106, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093826626","display_name":"Birte Ostermann","orcid":"https://orcid.org/0009-0009-1368-090X"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Birte Ostermann","raw_affiliation_strings":["Technische Universit\u00e4t Braunschweig, Institut f\u00fcr Analysis und Algebra, AG Algebra, Universit\u00e4tsplatz 2, Braunschweig, 38106, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Braunschweig, Institut f\u00fcr Analysis und Algebra, AG Algebra, Universit\u00e4tsplatz 2, Braunschweig, 38106, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052061811","display_name":"Sebastian Stiller","orcid":"https://orcid.org/0000-0002-8792-4390"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Stiller","raw_affiliation_strings":["Technische Universit\u00e4t Braunschweig, Institut f\u00fcr Mathematische Optimierung, Universit\u00e4tsplatz 2, Braunschweig, 38106, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Braunschweig, Institut f\u00fcr Mathematische Optimierung, Universit\u00e4tsplatz 2, Braunschweig, 38106, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059450802","display_name":"Timo de Wolff","orcid":"https://orcid.org/0000-0003-0883-1389"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Timo de Wolff","raw_affiliation_strings":["Technische Universit\u00e4t Braunschweig, Institut f\u00fcr Analysis und Algebra, AG Algebra, Universit\u00e4tsplatz 2, Braunschweig, 38106, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Braunschweig, Institut f\u00fcr Analysis und Algebra, AG Algebra, Universit\u00e4tsplatz 2, Braunschweig, 38106, Germany","institution_ids":["https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5092574783"],"corresponding_institution_ids":["https://openalex.org/I94509681"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67056758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"191","issue":null,"first_page":"107443","last_page":"107443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9298999905586243,"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.9298999905586243,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.021700000390410423,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.012299999594688416,"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/heuristics","display_name":"Heuristics","score":0.7505999803543091},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7303000092506409},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6226000189781189},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5580000281333923},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5116999745368958},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45899999141693115},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.39649999141693115}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7505999803543091},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7303000092506409},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6226000189781189},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5879999995231628},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5580000281333923},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5116999745368958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49950000643730164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47850000858306885},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45899999141693115},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.39649999141693115},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3693999946117401},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36489999294281006},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.35409998893737793},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.2712000012397766}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cor.2026.107443","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107443","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1965057580","https://openalex.org/W1985278890","https://openalex.org/W2012336927","https://openalex.org/W2017708378","https://openalex.org/W2024060531","https://openalex.org/W2042986967","https://openalex.org/W2102281241","https://openalex.org/W2104635975","https://openalex.org/W2106378689","https://openalex.org/W2107941094","https://openalex.org/W2137042221","https://openalex.org/W2139059344","https://openalex.org/W2140425706","https://openalex.org/W2148673189","https://openalex.org/W2154061444","https://openalex.org/W2160534125","https://openalex.org/W2163428398","https://openalex.org/W2163557644","https://openalex.org/W2614564353","https://openalex.org/W2810479212","https://openalex.org/W2886940793","https://openalex.org/W2921712036","https://openalex.org/W3047863327","https://openalex.org/W4214585224","https://openalex.org/W4252684946","https://openalex.org/W4285037282","https://openalex.org/W4386187744"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2026-03-10T00:00:00"}