Practical piecewise-linear approximation for monotropic optimization
From MaRDI portal
Publication:2884493
DOI10.1287/IJOC.12.4.324.11877zbMATH Open1238.90098OpenAlexW2107863746MaRDI QIDQ2884493FDOQ2884493
Authors: Spyros Kontogiorgis 
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.12.4.324.11877
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
Interior-point methods (90C51) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (13)
- Optimistic MILP modeling of non-linear optimization problems
- A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN
- A combined stochastic programming and optimal control approach to personal finance and pensions
- Uniform and monotone line sum optimization
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- Linearly constrained global optimization via piecewise-linear approximation
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- A review of piecewise linearization methods
- An effective linear approximation method for separable programming problems
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions
- Integer Programming and Combinatorial Optimization
- Title not available (Why is that?)
- Integrated ad delivery planning for targeted display advertising
Uses Software
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)
