A tabu search heuristic for the equitable coloring problem

Mostrar todas las versiones(2)

The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algor...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Méndez Díaz, I., Nasini, G., Severín, D., Associacao Portuguesa de Investigacao Operacional; de Lisboa, Centro de Investigacao Operacional; Faculdade de Ciencias da Universidade; Fundacao para a Ciencia e a Tecnologia; Instituto Nacional de Estatistica; Universite Paris-Dauphine, LAMSADE
Formato: SER
Materias:
Combinatorial optimization
Equitable coloring
Tabu search
Benchmarking
Heuristic algorithms
Heuristic methods
Arbitrary color
Computational experiment
Exact algorithms
Graph coloring problem
Large-sized
Local search
Tabu Search heuristic
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v8596LNCS_n_p347_MendezDiaz
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares