Three enhancements for optimization-based bound tightening
From MaRDI portal
Recommendations
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Bound reduction using pairs of linear inequalities
- Feasibility-based bounds tightening via fixed points
- A probing algorithm for MINLP with failure prediction by SVM
Cites work
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 2084783 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- A global optimization algorithm for linear fractional and bilinear programs
- A polyhedral branch-and-cut approach to global optimization
- A probing algorithm for MINLP with failure prediction by SVM
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Benchmarking optimization software with performance profiles.
- Bound reduction using pairs of linear inequalities
- Branching and bounds tighteningtechniques for non-convex MINLP
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational Integer Programming and Cutting Planes
- Depth-First Search and Linear Graph Algorithms
- Edmonds polytopes and a hierarchy of combinatorial problems
- Feasibility-based bounds tightening via fixed points
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Global optimization problems and domain reduction strategies
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- Mixed integer programming: analyzing 12 years of progress
- On handling indicator constraints in mixed integer programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Outline of an algorithm for integer solutions to linear programs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Progress in presolving for mixed integer programming
- SCIP: solving constraint integer programs
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving Real-World Linear Programs: A Decade and More of Progress
- The traveling salesman problem. A computational study.
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
Cited in
(38)- SUSPECT: MINLP special structure detector for Pyomo
- A new framework to relax composite functions in nonlinear programs
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- Modeling design and control problems involving neural network surrogates
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Tighter McCormick relaxations through subgradient propagation
- Combinatorial acyclicity models for potential‐based flows
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mathematical programming formulations for the alternating current optimal power flow problem
- (Global) optimization: historical notes and recent developments
- Deterministic global optimization with artificial neural networks embedded
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Exact solution of network flow models with strong relaxations
- Feasibility-based bounds tightening via fixed points
- Advances in verification of ReLU neural networks
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
- Bound reduction using pairs of linear inequalities
- Branching and bounds tighteningtechniques for non-convex MINLP
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Presolving linear bilevel optimization problems
- Domain reduction techniques for global NLP and MINLP optimization
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- General convex relaxations of implicit functions and inverse functions
- Deterministic global optimization with Gaussian processes embedded
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- A computational study on QP problems with general linear constraints
- Solving linear programs with complementarity constraints using branch-and-cut
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Deterministic global optimization of steam cycles using the IAPWS-IF97 model
- A probing algorithm for MINLP with failure prediction by SVM
- 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
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
Describes a project that uses
Uses Software
This page was built for publication: Three enhancements for optimization-based bound tightening
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522269)
