Research map / Learning theory and algorithms / Combinatorial and search optimization
A Fast Binary Quadratic Programming Solver Based on Stochastic Neighborhood Search
Benson S. Y. Lam, Alan Wee‐Chung Liew
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Large-Scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications (TPAMI 2016 · similarity 0.89)
- A Generalized Method for Binary Optimization: Convergence Analysis and Applications (TPAMI 2021 · similarity 0.86)
- Biconvex Relaxation for Semidefinite Programming in Computer Vision (ECCV 2016 · similarity 0.85)
- A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method for Efficient Optimization and Generalization (TPAMI 2021 · similarity 0.84)
- Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning (JMLR 2025 · similarity 0.84)
- Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
