Three enhancements for optimization-based bound tightening

From MaRDI portal
Publication:522269

DOI10.1007/s10898-016-0450-4zbMath1369.90106OpenAlexW2418003766MaRDI QIDQ522269

Ambros M. Gleixner, Benjamin Müller, Timo Berthold, Stefan Weltge

Publication date: 28 April 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-016-0450-4



Related Items

An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems, EAGO.jl: easy advanced global optimization in Julia, Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound, Global optimization of MIQCPs with dynamic piecewise relaxations, SUSPECT: MINLP special structure detector for Pyomo, A computational study on QP problems with general linear constraints, Modeling design and control problems involving neural network surrogates, Combinatorial acyclicity models for potential‐based flows, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, (Global) optimization: historical notes and recent developments, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Presolving linear bilevel optimization problems, General convex relaxations of implicit functions and inverse functions, Exact solution of network flow models with strong relaxations, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, Domain reduction techniques for global NLP and MINLP optimization, Deterministic global optimization of steam cycles using the IAPWS-IF97 model, An exploratory computational analysis of dual degeneracy in mixed-integer programming, Deterministic global optimization with artificial neural networks embedded, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A new framework to relax composite functions in nonlinear programs, An RLT approach for solving the binary-constrained mixed linear complementarity problem, Tighter McCormick relaxations through subgradient propagation, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, Solving linear programs with complementarity constraints using branch-and-cut, Mathematical programming formulations for the alternating current optimal power flow problem, Mathematical programming formulations for the alternating current optimal power flow problem, Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, Advances in verification of ReLU neural networks, Deterministic global optimization with Gaussian processes embedded


Uses Software


Cites Work