On the efficiency of an order-based representation in the clique covering problem

David Chalupa. On the efficiency of an order-based representation in the clique covering problem. In Terence Soule, Jason H. Moore, editors, Genetic and Evolutionary Computation Conference, GECCO '12, Philadelphia, PA, USA, July 7-11, 2012. pages 353-360, ACM, 2012. [doi]

@inproceedings{Chalupa12,
  title = {On the efficiency of an order-based representation in the clique covering problem},
  author = {David Chalupa},
  year = {2012},
  doi = {10.1145/2330163.2330215},
  url = {http://doi.acm.org/10.1145/2330163.2330215},
  researchr = {https://researchr.org/publication/Chalupa12},
  cites = {0},
  citedby = {0},
  pages = {353-360},
  booktitle = {Genetic and Evolutionary Computation Conference, GECCO '12, Philadelphia, PA, USA, July 7-11, 2012},
  editor = {Terence Soule and Jason H. Moore},
  publisher = {ACM},
  isbn = {978-1-4503-1177-9},
}