Lagrangean decompositions for the unconstrained binary quadratic programming problem

The unconstrained binary quadratic programming problem (QP) is a classical non‐linear problem of optimizing a quadratic objective by a suitable choice of binary decision variables. This paper proposes new Lagrangean decompositions to find bounds for QP. The methods presented treat a mixed binary lin...

Full description

Bibliographic Details

Published in:	International transactions in operational research Vol. 18; no. 2; pp. 257 - 270
Main Authors:	Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.03.2011 Pergamon
Subjects:	bounds Lagrangean decomposition Nonlinear programming Operations research Optimization Quadratic programming Studies
ISSN:	0969-6016, 1475-3995
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!