A New Branch and Bound Algorithm for the Clique Partitioning Problem

DOI10.1007/978-3-642-00142-0_74zbMath1209.90341OpenAlexW119756842MaRDI QIDQ5392092

Cornelius Schwarz, Jörg Rambau

Publication date: 7 April 2011

Published in: Operations Research Proceedings 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00142-0_74

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

This page was built for publication: A New Branch and Bound Algorithm for the Clique Partitioning Problem