Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

Pierre Hansen, Martine Labbé, David Schindl. Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discrete Optimization, 6(2):135-147, 2009. [doi]

@article{HansenLS09,
  title = {Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results},
  author = {Pierre Hansen and Martine Labbé and David Schindl},
  year = {2009},
  doi = {10.1016/j.disopt.2008.10.004},
  url = {http://dx.doi.org/10.1016/j.disopt.2008.10.004},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HansenLS09},
  cites = {0},
  citedby = {0},
  journal = {Discrete Optimization},
  volume = {6},
  number = {2},
  pages = {135-147},
}