A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem

DOI10.1145/2460239.2460253zbMath1369.68323OpenAlexW2031283589MaRDI QIDQ5276122

Heike Trautmann, Samadhi Nallaperuma, Bernd Bischl, Olaf Mersmann, Frank Neumann, Markus Wagner

Publication date: 14 July 2017

Published in: Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2440/83888

zbMATH Keywords

predictionclassificationlocal searchapproximation algorithmsfeature selectiontraveling salesperson problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (1)

A study on the effects of normalized TSP features for automated algorithm selection

This page was built for publication: A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem