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

Celý popis

Podrobná bibliografia

Vydané v:	International transactions in operational research Ročník 18; číslo 2; s. 257 - 270
Hlavní autori:	Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford, UK Blackwell Publishing Ltd 01.03.2011 Pergamon
Predmet:	bounds Lagrangean decomposition Nonlinear programming Operations research Optimization Quadratic programming Studies
ISSN:	0969-6016, 1475-3995
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!