Last change: 02.02.2024 10:23.
by Januschowski, Tim and
Pfetsch, Marc E.Reference:
Januschowski, Tim and Pfetsch, Marc E.: "Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry", In: Proc. 8th International Conference, CPAIOR 2011, Berlin (Achterberg, Tobias; Beck, J. Christopher, eds.), Springer, pp. 99–116, 2011.
Bibtex Entry:
@inproceedings{JanP11,
author = {Tim Januschowski and Marc E. Pfetsch},
title = {Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with
Symmetry},
editor = {Tobias Achterberg and J. Christopher Beck},
booktitle = {Proc. 8th International Conference, CPAIOR 2011, Berlin},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {6697},
year = {2011},
pages = {99--116}
} 
