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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization methods & software Jg. 32; H. 4; S. 719 - 737
1. Verfasser:	Castro, Pedro M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Taylor & Francis 04.07.2017 Taylor & Francis Ltd
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!