Piecewise linear approximation with minimum number of linear segments and minimum error: a fast approach to tighten and warm start the hierarchical mixed Integer formulation
From MaRDI portal
Publication:6554599
Cites work
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 195183 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting
- A fast segmentation algorithm for piecewise polynomial numeric function generators
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- Fitting piecewise linear continuous functions
- Fitting polygonal functions to a set of points in the plane
- Fitting rectilinear polgonal curves to a set of points in the plane.
- Hierarchical optimization: An introduction
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- On the number of segments needed in a piecewise linear approximation
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Pruning Pareto optimal solutions for multi-objective portfolio asset management
- Sur les fonctions convexes et les inégalités entre les valeurs moyennes.
This page was built for publication: Piecewise linear approximation with minimum number of linear segments and minimum error: a fast approach to tighten and warm start the hierarchical mixed Integer formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554599)
