A Tabu Search Heuristic for the Equitable Coloring Problem

DOI10.1007/978-3-319-09174-7_30zbMath1452.90276arXiv1405.7020OpenAlexW3098652757MaRDI QIDQ3195344

Daniel Severín, Isabel Méndez-Díaz, Graciela L. Nasini

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.7020

zbMATH Keywords

combinatorial optimizationtabu searchequitable coloring

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment ⋮ Improving lower bounds for equitable chromatic number ⋮ A flow based pruning scheme for enumerative equitable coloring algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
• A fast algorithm for equitable coloring
• Using tabu search techniques for graph coloring
• Conflict-free star-access in parallel memory systems
• Hybrid evolutionary algorithms for graph coloring
• A polyhedral approach for the equitable coloring problem
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• A survey of local search methods for graph coloring
• Compactness and balancing in scheduling
• Equitable Coloring
• Graph Colorings
• Perfect Graphs and an Application to Optimizing Municipal Services

This page was built for publication: A Tabu Search Heuristic for the Equitable Coloring Problem