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

DOI10.1080/10556788.2016.1264397zbMath1379.90019OpenAlexW2563569639MaRDI QIDQ4594828

Pedro M. Castro

Publication date: 24 November 2017

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2016.1264397

zbMATH Keywords

discretizationnonlinear programmingquadratic optimizationmixed integer nonlinear programmingbilinear terms

Mathematics Subject Classification ID

Mixed integer programming (90C11) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (4)

Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems ⋮ Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ Global optimization of MIQCPs with dynamic piecewise relaxations ⋮ Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique

Uses Software

• BARON
• GloMIQO

This page was built for publication: Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation