Pages that link to "Item:Q964964"

The following pages link to On the number of segments needed in a piecewise linear approximation (Q964964):

Displayed 7 items.

• A fast segmentation algorithm for piecewise polynomial numeric function generators (Q548302) ‎ (← links)
• Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods (Q1719642) ‎ (← links)
• Heuristics for the stochastic economic lot sizing problem with remanufacturing under backordering costs (Q1734341) ‎ (← links)
• A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times (Q2668748) ‎ (← links)
• An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem (Q5136076) ‎ (← links)
• A linear programming approach to difference-of-convex piecewise linear approximation (Q6090153) ‎ (← links)
• Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error (Q6166895) ‎ (← links)