Models for representing piecewise linear cost functions
From MaRDI portal
Recommendations
- A superior representation method for piecewise linear functions
- A note on ``A superior representation method for piecewise linear functions
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Locally ideal formulations for piecewise linear functions with indicator variables
Cites work
- A family of inequalities for the generalized assignment polytope
- A generalized assignment problem with special ordered sets: a polyhedral approach.
- Approximating separable nonlinear functions via mixed zero-one programs
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Computational study of a family of mixed-integer quadratic programming problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Facets of the Complementarity Knapsack Polytope
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the Solution of Discrete Programming Problems
- On the facial structure of scheduling polyhedra
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
Cited in
(48)- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Exact approaches to the single-source network loading problem
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Piecewise linear bounding functions in univariate global optimization
- Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator
- Fast feasibility check of the multi-material vertical alignment problem in road design
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- Integer programming for urban design
- The hill detouring method for minimizing hinging hyperplanes functions
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Capacitated refueling station location problem with traffic deviations over multiple time periods
- A combinatorial approach for small and strong formulations of disjunctive constraints
- A branch-cut-and-price algorithm for the piecewise linear transportation problem
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
- Piecewise-linear approximations of multidimensional functions
- An algorithm for piece-wise indefinite quadratic programming problem
- An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- On linear programs with linear complementarity constraints
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Global optimization of non-convex piecewise linear regression splines
- A note on ``A superior representation method for piecewise linear functions
- Global optimization for transport network expansion and signal setting
- Nonconvex, lower semicontinuous piecewise linear optimization
- Mixed integer models for the stationary case of gas network optimization
- Modelling piecewise linear concave costs in a tree partitioning problem
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
- Post-pruning in decision tree induction using multiple performance measures
- An efficient approach for the S‐shaped penalty function
- Locally ideal formulations for piecewise linear functions with indicator variables
- 0-1 reformulations of the multicommodity capacitated network design problem
- Varieties of Cost Functions
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- Piecewise linear approximation of functions of two variables in MILP models
- A polyhedral study of the semi-continuous knapsack problem
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- A superior representation method for piecewise linear functions
- Model for cost estimation in a finite-capacity environment
- Convex relaxations for gas expansion planning
- Models and strategies for efficiently determining an optimal vertical alignment of roads
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
This page was built for publication: Models for representing piecewise linear cost functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433660)
