A branch-and-price algorithm for the (k,c)-coloring problem
In this article, we study the (k,c)-coloring problem, a generalization of the vertex coloring problem where we have to assign k colors to each vertex of an undirected graph, and two adjacent vertices can share at most c colors. We propose a new formulation for the (k,c)-coloring problem and develop...
Guardado en:
| Autores principales: | Malaguti, E., Méndez-Díaz, I., José Miranda-Bront, J., Zabala, P. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00283045_v65_n4_p353_Malaguti |
| Aporte de: |
Ejemplares similares
-
A branch-and-price algorithm for the (k,c)-coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2015) -
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
por: Delle Donne, Diego, et al.
Publicado: (2011) -
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
por: Delle Donne, D., et al.
Publicado: (2011) -
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
por: Delle Donne, D., et al. -
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
por: Delle Donne, D., et al.
Publicado: (2011)