Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
From MaRDI portal
(Redirected from Publication:280099)
Recommendations
- 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
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
Cites work
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- A new reformulation-linearization technique for bilinear programming problems
- A polyhedral branch-and-cut approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- BARON: A general purpose global optimization software package
- Benchmarking optimization software with performance profiles.
- CONOPT—A Large-Scale GRG Code
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Handbook of test problems in local and global optimization
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Modelling with integer variables
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Test examples for nonlinear programming codes
- Univariate parameterization for global optimization of mixed-integer polynomial problems
Cited in
(14)- Global optimization of bilinear programs with a multiparametric disaggregation technique
- The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique
- Discretization and global optimization for mixed integer bilinear programming
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- Compact mixed-integer programming formulations in quadratic optimization
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Global optimization of MIQCPs with dynamic piecewise relaxations
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Product disaggregation in global optimization and relaxations of rational programs
This page was built for publication: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280099)
