Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
From MaRDI portal
Publication:4594828
DOI10.1080/10556788.2016.1264397zbMATH Open1379.90019OpenAlexW2563569639MaRDI QIDQ4594828FDOQ4594828
Authors: Pedro M. Castro 
Publication date: 24 November 2017
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1264397
Recommendations
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Global solution of non-convex quadratically constrained quadratic programs
discretizationnonlinear programmingquadratic optimizationmixed integer nonlinear programmingbilinear terms
Cited In (6)
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- 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
Uses Software
This page was built for publication: Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594828)
