Some Improvements on Kumlander-s Maximum Weight Clique Extraction Algorithm

Some fast exact algorithms for the maximum weight clique problem have been proposed. Ostergard’s algorithm is one of them. Kumlander says his algorithm is faster than it. But we confirmed that the straightforwardly implemented Kumlander’s algorithm is slower than Ostergard’s algorithm. We propose some improvements on Kumlander’s algorithm. Keywords—Maximum weight clique, exact algorithm, branch-andbound, NP-hard.