A tabu search heuristic for the equitable coloring problem

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, Isabel, Severin, Daniel E.
Publicado:	2014
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:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8596LNCS_n_p347_MendezDiaz 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

A tabu search heuristic for the equitable coloring problem
por: Méndez Díaz, I., et al.

A DSATUR-based algorithm for the Equitable Coloring Problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2015)

A DSATUR-based algorithm for the Equitable Coloring Problem
por: Méndez-Díaz, I., et al.

An exact DSatur-based algorithm for the Equitable Coloring Problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2013)

An exact DSatur-based algorithm for the Equitable Coloring Problem
por: Méndez-Díaz, I., et al.

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
por: Miranda Bront, Juan José
Publicado: (2017)

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
por: Kulich, M., et al.

Hybridizing multi-inver-over evolutionary algorithms with tabu search for the symmetric TSP
por: Bermúdez, Carlos, et al.
Publicado: (2001)

Extensión de algoritmos ACO usando conceptos de Tabu Search
por: Arito, Franco, et al.
Publicado: (2009)

A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, Sebastián, et al.
Publicado: (2001)

A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, S., et al.

A little respect (for the role of common components in heuristic search)
por: Chen, Stephen
Publicado: (2006)

Polyhedral results for the equitable coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2011)

Polyhedral results for the equitable coloring problem
por: Méndez-Diaz, I., et al.

A polyhedral approach for the equitable coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2014)

A polyhedral approach for the equitable coloring problem
por: Méndez-Díaz, I., et al.

Recursive and iterative algorithms for N-ary search problems
por: Sklyarov, Valery, et al.
Publicado: (2006)

New algorithms for composite retrieval
por: Méndez Díaz, Isabel, et al.
Publicado: (2017)

New algorithms for composite retrieval
por: Feuerstein, E., et al.

La analogía en la heurística del descubrimiento. Examen en base a Tótem y tabú
por: Pablo Rodriguez Osztreicher, et al.

A hybrid metaheuristic based on differential evolution and local search with quadratic interpolation
por: Tardivo, María Laura, et al.
Publicado: (2012)

Metaheurísticas híbridas aplicadas al problema de ruteo de arcos capacitados
por: Martínez, Cristian Alejandro
Publicado: (2011)

Metaheurísticas híbridas aplicadas al problema de ruteo de arcos capacitados
por: Martínez, Cristian Alejandro
Publicado: (2011)

Metaheurísticas híbridas aplicadas al problema de ruteo de arcos capacitados
por: Martínez, Cristian Alejandro
Publicado: (2011)

Evaluation of a heuristic search algorithm based on sampling and clustering
por: Harita, Maria, et al.
Publicado: (2021)

Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
por: Fernandez, Natalia, et al.
Publicado: (2001)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
por: Bonomo, Flavia
Publicado: (2011)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
por: Bonomo, F., et al.
Publicado: (2011)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
por: Bonomo, F., et al.

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
por: Bonomo, F., et al.
Publicado: (2011)

Metaheurísticas Multinivel para la Resolución del Set Covering Problem
por: Valenzuela, Claudio, et al.
Publicado: (2011)

Genetic algorithms for topical web search: A study of different mutation rates
por: Cecchini, Rocío L., et al.
Publicado: (2007)

Una metaheurística co-evolutiva para el problema del viajante de comercio
por: Holstein, Diana
Publicado: (1998)

Instances and source code for the paper An Exact Approach for the Balanced k-Way Partitioning Problem with Weight Constraints and its Application to Sports Team Realignment
por: Severín, Daniel Esteban, et al.
Publicado: (2020)

Planning the Workday of Bus Drivers by a Graph List-Coloring Model
por: Lucci, M., et al.
Publicado: (2018)

A branch-and-price algorithm for the (k,c)-coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2015)

A branch-and-price algorithm for the (k,c)-coloring problem
por: Malaguti, E., et al.

Optimización multi-objetivo : Aplicaciones a problemas del mundo real
por: López, Javier
Publicado: (2015)

The ant colony metaphor in continuous spaces using boundary search
por: Leguizamón, Guillermo
Publicado: (2003)

An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
por: Recalde, Diego, et al.
Publicado: (2020)