Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Global Optimization

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem

Cheng Zhu Lu, Zhenbo Wang, Wenxun Xing

Published Dec 17, 2009• 6 citations
Publisher
DOI
10.1007/s10898-009-9504-1

Related papers

Approximation Algorithm for A Mixed Binary Quadratically Constrained Quadratic Programming Problem

Zi Li Xu, Mingyi Hong

•Jan 1, 2015•1 citation

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Shenshen Gu, Rui Cui, Peng Jiao

Neurocomputing•Mar 9, 2016•5 citations

Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds

Zi Li Xu, Ming-Yi Hong

arXiv:1403.3998•Journal of the Operations Research Society of China•Jul 7, 2015•3 citations

Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT

Hans van Maaren, Joost P. Warners

Discrete Applied Mathematics•Dec 1, 2000•3 citations

A fast global algorithm for multi-linearly constrained separable binary quadratic program

Guangtai Qu, Shaoze Li, Zhibin Deng +1 more

The multi-linearly constrained separable binary quadratic programming problem (MLSBQP) is a direct extension of the classical singly-linearly constrained separable binary quadratic programming problem (SLSBQP). In the literature, several algorithms have been proposed for SLSBQP which can solve problem instances with millions of variables globally. However, for the case of MLSBQP, the current state-of-the-art solver can only solve problems with up to 40000 binary variables within a reasonable computational time. In this paper, we propose an extremely efficient branch-and-bound algorithm for solving MLSBQP. The main feature of the proposed algorithm is that an efficient dual coordinate ascent algorithm is applied to obtain lower bounds, and the complexity of each inner loop of the dual coordinate ascent algorithm is $ \mathcal{O}(n\log n) $. Our numerical experiments show that the proposed branch-and-bound algorithm can solve MLSBQP with up to millions of variables within only several minutes, and performs much faster than Gurobi when the number of linear constraints is small.

Journal of Industrial and Management Optimization•Oct 9, 2024•7 citations

The unconstrained binary quadratic programming problem: a survey

Gary A. Kochenberger, Jin‐Kao Hao, Fred Glover +4 more

Journal of Combinatorial Optimization•Apr 17, 2014•540 citations
The multi-linearly constrained separable binary quadratic programming problem (MLSBQP) is a direct extension of the classical singly-linearly constrained separable binary quadratic programming problem (SLSBQP). In the literature, several algorithms have been proposed for SLSBQP which can solve problem instances with millions of variables globally. However, for the case of MLSBQP, the current state-of-the-art solver can only solve problems with up to 40000 binary variables within a reasonable computational time. In this paper, we propose an extremely efficient branch-and-bound algorithm for solving MLSBQP. The main feature of the proposed algorithm is that an efficient dual coordinate ascent algorithm is applied to obtain lower bounds, and the complexity of each inner loop of the dual coordinate ascent algorithm is $ \mathcal{O}(n\log n) $. Our numerical experiments show that the proposed branch-and-bound algorithm can solve MLSBQP with up to millions of variables within only several minutes, and performs much faster than Gurobi when the number of linear constraints is small.