An effective linear approximation method for separable programming problems
From MaRDI portal
Publication:1036545
DOI10.1016/j.amc.2009.07.007zbMath1192.65077OpenAlexW2017675572MaRDI QIDQ1036545
Publication date: 13 November 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.07.007
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Discharge allocation for hydro-electric generating stations
- Optimal objective function approximation for separable convex quadratic programming
- Approximating separable nonlinear functions via mixed zero-one programs
- An algorithm for approximating piecewise linear concave functions from sample gradients
- Deterministic global optimization. Theory, methods and applications
- Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Practical Piecewise-Linear Approximation for Monotropic Optimization
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Objective function approximations in mathematical programming
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- The facility location problem with general cost functions
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Flow pack facets of the single node fixed-charge flow polytope
- A practical guide to splines.
This page was built for publication: An effective linear approximation method for separable programming problems
