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
propagationMINLPbound tighteningOBBToptimality-based bound tighteningoptimization-based bound tightening
Related Items (32)
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- SCIP: solving constraint integer programs
- Progress in presolving for mixed integer programming
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A polyhedral branch-and-cut approach to global optimization
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A global optimization algorithm for linear fractional and bilinear programs
- A branch-and-reduce approach to global optimization
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Global optimization problems and domain reduction strategies
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- On handling indicator constraints in mixed integer programming
- Bound reduction using pairs of linear inequalities
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Edmonds polytopes and a hierarchy of combinatorial problems
- A Probing Algorithm for MINLP with Failure Prediction by SVM
- Feasibility-Based Bounds Tightening via Fixed Points
- Outline of an algorithm for integer solutions to linear programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Solving Real-World Linear Programs: A Decade and More of Progress
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Computational Integer Programming and Cutting Planes
- Complete search in continuous global optimization and constraint satisfaction
- Solution of a Large-Scale Traveling-Salesman Problem
- Depth-First Search and Linear Graph Algorithms
- Benchmarking optimization software with performance profiles.
This page was built for publication: Three enhancements for optimization-based bound tightening