Three enhancements for optimization-based bound tightening

From MaRDI portal
Revision as of 06:25, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (32)

An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systemsEAGO.jl: easy advanced global optimization in JuliaPump scheduling in drinking water distribution networks with an LP/NLP-based branch and boundGlobal optimization of MIQCPs with dynamic piecewise relaxationsSUSPECT: MINLP special structure detector for PyomoA computational study on QP problems with general linear constraintsModeling design and control problems involving neural network surrogatesCombinatorial acyclicity models for potential‐based flowsVariable Bound Tightening and Valid Constraints for Multiperiod BlendingEnhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming(Global) optimization: historical notes and recent developmentsUsing Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear TermsPresolving linear bilevel optimization problemsGeneral convex relaxations of implicit functions and inverse functionsExact solution of network flow models with strong relaxationsComputational advances in polynomial optimization: RAPOSa, a freely available global solverDomain reduction techniques for global NLP and MINLP optimizationDeterministic global optimization of steam cycles using the IAPWS-IF97 modelAn exploratory computational analysis of dual degeneracy in mixed-integer programmingDeterministic global optimization with artificial neural networks embeddedSCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut frameworkA new framework to relax composite functions in nonlinear programsAn RLT approach for solving the binary-constrained mixed linear complementarity problemTighter McCormick relaxations through subgradient propagationMonotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columnsSolving linear programs with complementarity constraints using branch-and-cutMathematical programming formulations for the alternating current optimal power flow problemMathematical programming formulations for the alternating current optimal power flow problemComputing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problemsLinearization of McCormick relaxations and hybridization with the auxiliary variable methodAdvances in verification of ReLU neural networksDeterministic global optimization with Gaussian processes embedded


Uses Software



Cites Work




This page was built for publication: Three enhancements for optimization-based bound tightening