Bibliography on Maximum-Weight Clique Problem

maintained by Wladimir Tavares

This article included in this bibliography focus on the maximum weight clique problem. Publications are organized in following categories:

Exact Method

[CP90] Randy Carraghan and Panos M. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters, 9(6):375 - 382, 1990. [ bib ]
[BX91] Egon Balas and Jue Xue. Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs. SIAM J. Comput., 20(2):209-221, 1991. [ bib ]
[Bab94] Luitpold Babel. A fast algorithm for the maximum weight clique problem. Computing, 52(1):31-38, 1994. [ bib ]
[BX96] Egon Balas and Jue Xue. Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica, 15(5):397-412, 1996. [ bib ]
[Öst99] Patric R.J. Östergård. A new algorithm for the maximum-weight clique problem. Electronic Notes in Discrete Mathematics, 3(0):153 - 156, 1999. 6th Twente Workshop on Graphs and Combinatorial Optimization. [ bib ]
[WH06] Jeffrey S Warren and Illya V Hicks. Combinatorial branch-and-bound for the maximum weight independent set problem. Tecnical Report Texas A&M University, 2006. [ bib ]
[Ave07] Alessandro Avenali. Resolution branch and bound and an application: The maximum weighted stable set problem. Operations Research, 55(5):932-948, 2007. [ bib ]
[YM08] K. Yamaguchi and S. Masuda. A new exact algorithm for the maximum weight clique problem. pages 317-320. Proc. of the 23rd International Technical Conference on Circuits/Systems, Computers and Communications, 2008. [ bib ]
[Kum08a] Deniss Kumlander. On importance of a special sorting in the maximum-weight clique algorithm based on colour classes. 14:165-174, 2008. [ bib ]
[SYSM12] Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, and Sumio Masuda. Some improvements on kumlander-s maximum weight clique extraction algorithm. 6(12):1770 - 1774, 2012. [ bib ]
[HCS12] Stephan Held, William Cook, and Edward C. Sewell. Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput., 4(4):363-381, 2012. [ bib ]
[SYSM13] Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, and Sumio Masuda. Optimal Table Method for Finding the Maximum Weight Clique. Proceedings of the 13th International Conference on Applied Computer Science (ACS'13), 2013. [ bib ]
[FLQ+14] Zhiwen Fang, Chu-Min Li, Kan Qiao, Xu Feng, and Ke Xu. Solving maximum weight clique using maximum satisfiability reasoning. In Torsten Schaub, Gerhard Friedrich, and Barry O'Sullivan, editors, ECAI 2014 - 21st European Conference on Artificial Intelligence, volume 263 of Frontiers in Artificial Intelligence and Applications, pages 303-308. IOS Press, 2014. [ bib ]
[TNRM15] Wladimir Araujo Tavares, Manoel Bezerra Campelo Neto, Carlos Diego Rodrigues, and Philippe Michelon. Um algoritmo de branch and bound para o problema da clique maxima ponderada. Proceedings of XLVII SBPO, 1:2655-2666, 2015. [ bib ]
[WH16] Qinghua Wu and Jin-Kao Hao. A clique-based exact method for optimal winner determination in combinatorial auctions. Information Sciences, 334:103-121, 2016. [ bib ]