Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research Jg. 39; H. 7; S. 1577 - 1581
Hauptverfasser: Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 01.07.2012
Elsevier
Pergamon Press Inc
Schlagworte:
Clusters
Column generation
Decomposition
Forming
Graph theory
Graphs
Lagrange multiplier
Lagrangian decomposition
Mathematical analysis
Mathematical models
Operations research
Quadratic programming
Studies
Quadratic programming
Lagrangian decomposition
Column generation
ISSN:0305-0548, 1873-765X, 0305-0548
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2011.09.008