OpenAlex
PricingAboutJobs
Log inGet started
Work

The Suffering Salesperson: Measuring the Difficulty of TSP Instances and Generating Instances with Weighted Anytime Runtime Performance

HTML

Year: 2026
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Parallel Problem Solving from Nature – PPSN XIX: 19th International Conference, PPSN 2026, Trento, Italy, August 29 – September 2, 2026, Proceedings, Part I
DOI: 10.1007/978-3-032-36214-8_29
Authors: Jonathan Heins, Anna Franke, Markus Leyser, Sebastian Dengel, Pascal Kerschke
Institutions: Center for Scalable Data Analytics and Artificial Intelligence, Technische Universität Dresden
Language: English

Topic: Metaheuristic Optimization Algorithms Research
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: traveling salesman problem, instance generation, anytime algorithms, benchmarking, combinatorial optimization, package delivery

Open Access status: closed
OpenAlex ID: W7204128985
FWCI:
Cites: 37
Cited by:
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms