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

researchr

You are not signed in
Sign in
Sign up

Olaf Mersmann, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner 0007, Frank Neumann. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In Youssef Hamadi, Marc Schoenauer, editors, Learning and Intelligent Optimization - 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers. Volume 7219 of Lecture Notes in Computer Science, pages 115-129, Springer, 2012. [doi]

This author has not been identified. Look up 'Olaf Mersmann' in GoogleThis author has not been identified. Look up 'Bernd Bischl' in GoogleThis author has not been identified. Look up 'Jakob Bossek' in GoogleThis author has not been identified. Look up 'Heike Trautmann' in GoogleThis author has not been identified. Look up 'Markus Wagner 0007' in GoogleThis author has not been identified. Look up 'Frank Neumann' in Google

runs on WebDSL