Distance based hybrid genetic algorithm: an application for the graph coloring problem

Kiyoharu Tagawa, Kenji Kanesige, Katsumi Inoue, Hiromasa Haneda. Distance based hybrid genetic algorithm: an application for the graph coloring problem. In Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, Washington, DC, USA July 6-9, 1999. pages 2325-2332, IEEE, 1999. [doi]

@inproceedings{TagawaKIH99,
  title = {Distance based hybrid genetic algorithm: an application for the graph coloring problem},
  author = {Kiyoharu Tagawa and Kenji Kanesige and Katsumi Inoue and Hiromasa Haneda},
  year = {1999},
  doi = {10.1109/CEC.1999.785564},
  url = {https://doi.org/10.1109/CEC.1999.785564},
  researchr = {https://researchr.org/publication/TagawaKIH99},
  cites = {0},
  citedby = {0},
  pages = {2325-2332},
  booktitle = {Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, Washington, DC, USA July 6-9, 1999},
  publisher = {IEEE},
  isbn = {0-7803-5536-9},
}