Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation

Spatial branch-and-bound (B&B) is widely used for the global optimization of non-convex problems. It basically works by iteratively reducing the domain of the variables so that tighter relaxations can be achieved that ultimately converge to the global optimal solution. Recent developments for bi...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization methods & software Ročník 32; číslo 4; s. 719 - 737
Hlavný autor:	Castro, Pedro M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Taylor & Francis 04.07.2017 Taylor & Francis Ltd
Predmet:	Algorithms bilinear terms Branch & bound algorithms discretization Global optimization Lower bounds mixed-integer nonlinear programming nonlinear programming Partitions Production scheduling quadratic optimization Solvers Tightening
ISSN:	1055-6788, 1029-4937
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!