A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives-Reference-Cited by-同舟云学术

A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives

Published:2009-12 Issue: Volume:35 Page:347-352
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

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

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference9 articles.

1. Bahiense, L., S. Jurkiewicz, A. Lozano, M. Pimenta, C. Waga, and C. Valladares, An integer programming approach to equitable coloring problems, in Proceedings of the XXXIX Brazilian Symposium on Operations Research, vol. 1, Fortaleza, 2007, pp. 1795–1801

2. On the asymmetric representatives formulation for the vertex coloring problem;Campêlo;Electronic Notes in Discrete Mathematics,2005

3. Cliques, holes and the vertex coloring polytope;Campêlo;Information Processing Letters,2004

4. Frota, Y., N. Maculan, T.F. Noronha, and C.C. Ribeiro, A branch-and-cut algorithm for partition coloring, Networks, 2009, to appear

5. The Complexity of Equitable Vertex Coloring of Graphs;Furmańczyk;Journal of Applied Computer Science,2005

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Local search for weighted sum coloring problem;Applied Soft Computing;2021-07

2. Integer programming formulations and efficient local search for relaxed correlation clustering;Journal of Global Optimization;2021-02-13

3. A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph;Discrete Applied Mathematics;2019-05

4. Backtracking based iterated tabu search for equitable coloring;Engineering Applications of Artificial Intelligence;2015-11

5. A polyhedral approach for the equitable coloring problem;Discrete Applied Mathematics;2014-02