Comments on: Tabu search tutorial. A Graph Drawing Application

As suggested by its title, the aim of this paper is to discuss how tabu search can be successfully applied to find high-quality solutions for a wide family of NP-hard optimization problems arising in a huge number of applied mathematics areas. The authors show that a graph drawing problem application is one of those excellent examples, given that since ever geometric representations play an important role in many real-world scenarios and are an important applied branch of graph theory. This paper is divided in six sections. After an introductory section about the content of the article, a long section follows dedicated to a rich description of the tabu search scheme. The third section describes arc crossing and long arcs issues in graph theory and optimization. In Sect. 4, the authors describe the main ingredients of a tabu search for graph drawing and in Sect. 5 they report an extensive and critical analysis of the computational results they obtained in the comparison of the tabu search they designed with the state of the art techniques. Conclusions are drawn in the last section