A linear programming approach to difference-of-convex piecewise linear approximation
From MaRDI portal
Publication:6090153
DOI10.1016/j.ejor.2023.07.026OpenAlexW4385076334MaRDI QIDQ6090153
Publication date: 14 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.07.026
Cites Work
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Fitting piecewise linear continuous functions
- Mixed integer linear models for the optimization of dynamical transport networks
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions
- On the number of segments needed in a piecewise linear approximation
- Piecewise-linear approximations of multidimensional functions
- DC decomposition of nonconvex polynomials with algebraic techniques
- Simplexity of the cube
- Piecewise linear approximation of functions of two variables in MILP models
- Strong formulations for the pooling problem
- Mixed Integer Linear Programming Formulation Techniques
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Pooling Problem: Alternate Formulations and Solution Methods
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- Canonical piecewise-linear approximations
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting
- Pyomo -- optimization modeling in Python
- Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error
This page was built for publication: A linear programming approach to difference-of-convex piecewise linear approximation
