branch-and-bound algorithm

Efficient Sparse PCA via Block-Diagonalization ICLR 2025 Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem IJCAI 2025 Probabilistic Semantics Guided Discovery of Approximate Functional Dependencies UAI 2025 A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem AAAI 2024 Multi-View Randomized Kernel Classification via Nonconvex Optimization AAAI 2024 AND/OR branch-and-bound for computational protein design optimizing K* UAI 2022 An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs AAAI 2022 Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features ICML 2022 Abstraction-based branch and bound approach to Q-learning for hybrid optimal control L4DC 2021 Globally Optimal 2D-3D Registration From Points or Lines Without Correspondences ICCV 2015 Box in the Box: Joint 3D Layout and Object Reasoning from Single Images ICCV 2013 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Size Matters: Metric Visual Search Constraints from Monocular Metadata NeurIPS 2010 Branch and Bound for Semi-Supervised Support Vector Machines NeurIPS 2006