Practical piecewise-linear approximation for monotropic optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3916036
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
- Linearly constrained global optimization via piecewise-linear approximation
- Approximating separable nonlinear functions via mixed zero-one programs
- Integer Programming and Combinatorial Optimization
Cited in
(13)- An effective linear approximation method for separable programming problems
- Uniform and monotone line sum optimization
- Linearly constrained global optimization via piecewise-linear approximation
- A combined stochastic programming and optimal control approach to personal finance and pensions
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Optimistic MILP modeling of non-linear optimization problems
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- scientific article; zbMATH DE number 3916036 (Why is no real title available?)
- A review of piecewise linearization methods
- A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN
- Integrated ad delivery planning for targeted display advertising
- Integer Programming and Combinatorial Optimization
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions
This page was built for publication: Practical piecewise-linear approximation for monotropic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884493)
