"branch-and-bound algorithm" Papers
2 papers found
Conference
Efficient Sparse PCA via Block-Diagonalization
Alberto Del Pia, Dekun Zhou, Yinglun Zhu
ICLR 2025arXiv:2410.14092
2
citations
KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum K-defective Clique Problem
Jiongzhi Zheng, Mingming Jin, Kun He
AAAI 2024paperarXiv:2308.07235
4
citations