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

Full description

Bibliographic Details

Published in:	Optimization methods & software Vol. 32; no. 4; pp. 719 - 737
Main Author:	Castro, Pedro M.
Format:	Journal Article
Language:	English
Published:	Abingdon Taylor & Francis 04.07.2017 Taylor & Francis Ltd
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!