OpenAlex
PricingAboutJobs
Log inGet started
Work

Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness

HTML

Year: 2012
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Learning and Intelligent Optimization: 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers
DOI: 10.1007/978-3-642-34413-8_9
Authors: Olaf Mersmann, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, Frank Neumann
Institutions: TU Dortmund University, The University of Adelaide
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: traveling salesman problem, 2-opt, local search, problem difficulty, approximation ratio

Open Access status: closed
OpenAlex ID: W19784850
FWCI: 2.564
Cites: 26
Cited by: 52
Related to: 9
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
Security