Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Serna Iglesias, María José
Data de publicació
2019-07-04
Resum
The aim of this project is to develop efficient algorithms for solving or approximating the Minimum Restricted Linear Coloring Arrangement Problem. It is the first approach to its algorithms, and we will face the problem from different perspectives: constraint programming, backtracking, greedy, and genetic algorithms. As a second goal we are interested in providing theoretical results for particular graphs.
