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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 275; H. 2; S. 587 - 605
Hauptverfasser:	Nayak, Rupaj Kumar, Mohanty, Nirmalya Kumar
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2019 Springer Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!