On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
From MaRDI portal
Publication:2115319
DOI10.1007/s11590-021-01740-1zbMath1487.90484OpenAlexW3174419237MaRDI QIDQ2115319
Publication date: 15 March 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01740-1
Related Items
An approximation algorithm for optimal piecewise linear interpolations of bounded variable products, Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
Uses Software
Cites Work
- Optimistic MILP modeling of non-linear optimization problems
- A reformulation framework for global optimization
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- Piecewise-linear approximations of multidimensional functions
- Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
- Mixed integer models for the stationary case of gas network optimization
- Simplizialzerlegungen von beschränkter Flachheit
- Using Piecewise Linear Functions for Solving MINLPs
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- On the Solution of Discrete Programming Problems
- Towards simulation based mixed‐integer optimization with differential equations
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Polyhedral methods for piecewise-linear functions. I: The lambda method