Branch-Cut-and-Propagate for the Maximum ::::k::::-Colorable Subgraph Problem with Symmetry - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Tim Januschowski, Marc E. Pfetsch. Branch-Cut-and-Propagate for the Maximum ::::k::::-Colorable Subgraph Problem with Symmetry. In Tobias Achterberg, J. Christopher Beck, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings. Volume 6697 of Lecture Notes in Computer Science, pages 99-116, Springer, 2011. [doi]

This author has not been identified. Look up 'Tim Januschowski' in GoogleThis author has not been identified. Look up 'Marc E. Pfetsch' in Google

runs on WebDSL