On the number of segments needed in a piecewise linear approximation
From MaRDI portal
Publication:964964
DOI10.1016/j.cam.2009.12.035zbMath1190.65024OpenAlexW2132688505MaRDI QIDQ964964
Tsutomu Sasao, Jon T. Butler, C. L. Frenzen
Publication date: 21 April 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2009.12.035
Related Items (7)
A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ A linear programming approach to difference-of-convex piecewise linear approximation ⋮ Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error ⋮ Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods ⋮ An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem ⋮ Heuristics for the stochastic economic lot sizing problem with remanufacturing under backordering costs ⋮ A fast segmentation algorithm for piecewise polynomial numeric function generators
Uses Software
Cites Work
This page was built for publication: On the number of segments needed in a piecewise linear approximation
