Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness
Year: 2012
Type: conference-paper
Institutions: TU Dortmund University, The University of Adelaide
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W19784850
