Models for representing piecewise linear cost functions
From MaRDI portal
Publication:1433660
DOI10.1016/S0167-6377(03)00059-2zbMath1056.90107MaRDI QIDQ1433660
Nemhauser, George I., Ismael Regis jun. de Farias, Ahmet Burak Keha
Publication date: 1 July 2004
Published in: Operations Research Letters (Search for Journal in Brave)
90C11: Mixed integer programming
Related Items
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing, On linear programs with linear complementarity constraints, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Post-pruning in decision tree induction using multiple performance measures, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Nonconvex, lower semicontinuous piecewise linear optimization, Piecewise-linear approximations of multidimensional functions, 0-1 reformulations of the multicommodity capacitated network design problem, The hill detouring method for minimizing hinging hyperplanes functions, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Exact penalty and optimality condition for nonseparable continuous piecewise linear programming, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, Piecewise linear approximation of functions of two variables in MILP models, A polyhedral study of the semi-continuous knapsack problem, Locally ideal formulations for piecewise linear functions with indicator variables, Mixed integer models for the stationary case of gas network optimization, Exact approaches to the single-source network loading problem, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation
Cites Work
- Disjunctive programming: Properties of the convex hull of feasible points
- Approximating separable nonlinear functions via mixed zero-one programs
- Computational study of a family of mixed-integer quadratic programming problems
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- On the Solution of Discrete Programming Problems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the facial structure of scheduling polyhedra
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
- Facets of the Complementarity Knapsack Polytope
- A generalized assignment problem with special ordered sets: a polyhedral approach.
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- A family of inequalities for the generalized assignment polytope
