Author:
Méndez-Díaz Isabel,Nasini Graciela,Severín Daniel
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference19 articles.
1. K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, B. Jansen, A branch-and-cut algorithm for the frequency assignment problem, Tech. Report, Maastricht University, 1996.
2. A branch-and-cut algorithm for equitable coloring based on a formulation by representatives;Bahiense;Electron. Notes Discrete Math.,2009
3. L. Bahiense, Y. Frota, T. Noronha, C. Ribeiro, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives, Discrete Appl. Math. (2011), in press (http://dx.doi.org/10.1016/j.dam.2011.10.008).
4. On the asymmetric representatives formulation for the vertex coloring problem;Campêlo;Discrete Appl. Math.,2008
5. Bor-Liang Chen, Kuo-Ching Huang, On the equitable colorings of Kneser graphs, in: India-Taiwan Conference on Discrete Mathematics, NTU, 2009.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献