A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives

Bahiense, Laura; Frota, Yuri; Noronha, Thiago F.; Ribeiro, Celso C.

doi:10.1016/j.dam.2011.10.008

Cited by 23 publications

(33 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Last two columns show the same information for the tabu search described in [10]. If such information is not available, these columns are left empty.…”

Section: Testing Tabu Search Heuristicmentioning

confidence: 99%

“…In Table 2 we report results over 76 benchmark instances with at least 50 vertices (75 from [18] and one Kneser graph used in [10]). First 5 columns have the name of the graph G, number of vertices and edges, and best known lower and upper bound of χ eq (G).…”

Section: Testing Tabu Search Heuristicmentioning

confidence: 99%

“…Then, we report the behaviour of TabuEqCol over known instances by using the best combination previously found. We also compare its performance against tabu search algorithm given in [10].…”

Section: Computational Experiments and Conclusionmentioning

confidence: 99%

“…If such information is not available, these columns are left empty. We recall that the values provided in [10] were computed on a different platform (1.8 Ghz AMD-Athlon with Linux and GNU C++ compiler).…”

Section: Testing Tabu Search Heuristicmentioning

confidence: 99%

“…The authors of [10] propose a tabu search heuristic to initialize an exact algorithm that solves ECP via Integer Linear Programming (ILP) techniques. Other exact algorithms for solving ECP are given in [11] and [12].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Tabu Search Heuristic for the Equitable Coloring Problem

Díaz¹,

Nasini²,

Severín³

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The Equitable Coloring Problem is a variant of the GraphColoring 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 algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.

show abstract

“…Last two columns show the same information for the tabu search described in [10]. If such information is not available, these columns are left empty.…”

Section: Testing Tabu Search Heuristicmentioning

confidence: 99%

Section: Testing Tabu Search Heuristicmentioning

confidence: 99%

Section: Computational Experiments and Conclusionmentioning

confidence: 99%

Section: Testing Tabu Search Heuristicmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Tabu Search Heuristic for the Equitable Coloring Problem

Díaz¹,

Nasini²,

Severín³

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Equitable Coloring of Graphs

Lih

2013

Handbook of Combinatorial Optimization

View full text Add to dashboard Cite

A Tabu Search Heuristic for the Equitable Coloring Problem

Díaz

Nasini

Severín

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.

show abstract

A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives

Cited by 23 publications

References 13 publications

A Tabu Search Heuristic for the Equitable Coloring Problem

A Tabu Search Heuristic for the Equitable Coloring Problem

Equitable Coloring of Graphs

A Tabu Search Heuristic for the Equitable Coloring Problem

Contact Info

Product

Resources

About