Comments on: Tabu search tutorial. A Graph Drawing Application

Paola Festa ^[1]
1. [1] University of Napoli FEDERICO II, Italia
Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 29, Nº. 2, 2021, págs. 351-353
Idioma: inglés
DOI: 10.1007/s11750-021-00607-z
Enlaces
- Texto completo
Resumen
- 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.