Paper Info
Title
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
Abstract
This paper presents a new alternative of Lagrangian decomposition based on column generation technique to solve the unconstrained binary quadratic programming problem. We use a mixed binary linear version of the original quadratic problem with constraints represented by a graph. This graph is partitioned into clusters of vertices forming subproblems whose solutions use the dual variables obtained by a coordinator problem. Computational experiments consider a set of difficult instances and the results are compared against other methods reported recently in the literature.
Year
DOI
Venue
2012
10.1016/j.cor.2011.09.008
Computers & OR
Keywords
DocType
Volume
Lagrangian decomposition,difficult instance,unconstrained binary quadratic programming,mixed binary linear version,dual variable,new alternative,column generation technique,computational experiment,coordinator problem,original quadratic problem
Journal
39
Issue
ISSN
Citations 
7
0305-0548
3
PageRank 
References 
Authors
0.43
11
2
Name
Order
Citations
PageRank
Geraldo Regis Mauri1888.79
Luiz Antonio Nogueira Lorena249836.72