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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 275; číslo 2; s. 587 - 605
Hlavní autoři:	Nayak, Rupaj Kumar, Mohanty, Nirmalya Kumar
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.04.2019 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!