Improved row-by-row method for binary quadratic optimization problems

The research presented here is an improved row-by-row (RBR) algorithm for the solution of boolean quadratic programming (BQP) problems. While a faster and implementable RBR method has been widely used for semidefinite programming (SDP) relaxed BQPs, it can be challenged by SDP relaxations because of...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 275; no. 2; pp. 587 - 605
Main Authors:	Nayak, Rupaj Kumar, Mohanty, Nirmalya Kumar
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2019 Springer Springer Nature B.V
Subjects:	Acoustics Algorithms Boolean algebra Business and Management Combinatorics Lower bounds Management science Operations research Operations Research/Decision Theory Optimization Optimization theory Original Research Quadratic programming Semidefinite programming Signal processing Studies Theory of Computation Computer vision Semidefinite programming First order method Row-by-row method Unconstrained quadratic binary optimization
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!