Approximating separable nonlinear functions via mixed zero-one programs
From MaRDI portal
Recommendations
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- scientific article; zbMATH DE number 3916036
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Reduction of nonlinear integer separable programming problems∗
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3307136 (Why is no real title available?)
- Linear optimization and extensions.
- Location, scheduling, design and integer programming
Cited in
(53)- Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems
- An effective linear approximation method for separable programming problems
- Piece-wise linear approximation of functions of two variables
- Models for representing piecewise linear cost functions
- A modified goal programming model for piecewise linear functions
- Staircase compatibility and its applications in scheduling and piecewise linearization
- Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
- Optimizing water tanks in water distribution systems by combining network reduction, mathematical optimization and hydraulic simulation
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- Compact mixed-integer programming formulations in quadratic optimization
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Mathematical programming formulations for piecewise polynomial functions
- Joint model of probabilistic-robust (probust) constraints applied to gas network optimization
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
- Piecewise linear approximation of functions of two variables in MILP models
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- An efficient convexification method for solving generalized geometric problems
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- Locally ideal formulations for piecewise linear functions with indicator variables
- Incremental and encoding formulations for mixed integer programming
- Linearly constrained global optimization via piecewise-linear approximation
- Mixed integer models for the stationary case of gas network optimization
- Piecewise polyhedral formulations for a multilinear term
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
- Mixed integer linear programming formulation techniques
- Practical piecewise-linear approximation for monotropic optimization
- Structural investigation of piecewise linearized network flow problems
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- scientific article; zbMATH DE number 3916036 (Why is no real title available?)
- Reduction of nonlinear integer separable programming problems∗
- Finding all solutions of separable systems of piecewise-linear equations using integer programming
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Mixed integer linear models for the optimization of dynamical transport networks
- Piecewise polyhedral relaxations of multilinear optimization
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- Global solution of optimization problems with signomial parts
- Piecewise-linear approximations of multidimensional functions
- Nonlinear separation of data via mixed 0-1 integer and linear programming
This page was built for publication: Approximating separable nonlinear functions via mixed zero-one programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591598)
