dc.contributor
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor
Serna Iglesias, María José
dc.contributor.author
Llop Palao, Joan
dc.date.issued
2019-07-04
dc.identifier
https://hdl.handle.net/2117/168917
dc.description.abstract
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.
dc.format
application/pdf
dc.publisher
Universitat Politècnica de Catalunya
dc.subject
Àrees temàtiques de la UPC::Informàtica
dc.subject
Genetic algorithms
dc.subject
Minimum Restricted Linear Coloring Arrangement Problem
dc.subject
constraint programming
dc.subject
and genetic algorithms.
dc.subject
Algorismes genètics
dc.subject
Grafs, Teoria de
dc.title
Algorithms for the restricted linear coloring arrangement problem
