Semidefinite relaxations for non-convex quadratic mixed-integer programming

We present semidefinite relaxations for unconstrained non-convex quadratic mixed-integer optimization problems. These relaxations yield tight bounds and are computationally easy to solve for medium-sized instances, even if some of the variables are integer and unbounded. In this case, the problem co...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 141; číslo 1-2; s. 435 - 452
Hlavní autoři:	Buchheim, Christoph, Wiegele, Angelika
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2013 Springer Nature B.V
Témata:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Computation Computer programming Full Length Paper Integer programming Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Optimization techniques Programming Routines Studies Theoretical Variables United States > US 90C20 90C10 90C26 90C11 90C22
ISSN:	0025-5610, 1436-4646
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!