|
Descripción
|
|
|---|---|
| In recent years there have been a number of important improvements in exact color-based maximum clique solvers, which have considerably enhanced their performance. Initial vertex ordering is one strategy known to have a significant impact on the size of the search tree. Typically, a degenerate sorting by minimum degree is used; literature also reports different tiebreaking strategies. A systematic study of the impact of initial sorting in the light of new cutting-edge ideas (e.g. recoloring [8], selective coloring [13], ILS initial lower bound computation [15-16] or MaxSAT-based pruning [14]) is, however, lacking. This paper presents a new initial sorting procedure and relates performance to the new mentioned variants implemented in leading solver BBMC [9-10]. | |
|
Internacional
|
Si |
|
Nombre congreso
|
IX Conf. on Learning and Intelligent Optimization (LION 8) http://caopt.com/LION8/ |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Florida, USA, 2014 |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-3-319-09584-4 |
|
DOI
|
10.1007/978-3-319-09584-4_12 |
|
Fecha inicio congreso
|
16/02/2014 |
|
Fecha fin congreso
|
21/02/2014 |
|
Desde la página
|
111 |
|
Hasta la página
|
120 |
|
Título de las actas
|
Learning and Intelligent Optimization LNCS 8426 |