Models for representing piecewise linear cost functions
From MaRDI portal
Publication:1433660
DOI10.1016/S0167-6377(03)00059-2zbMath1056.90107OpenAlexW2078511023MaRDI QIDQ1433660
Ahmet Burak Keha, Ismael Regis jun. de Farias, Nemhauser, George I.
Publication date: 1 July 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00059-2
Related Items
Capacitated refueling station location problem with traffic deviations over multiple time periods, Exact approaches to the single-source network loading problem, A branch-cut-and-price algorithm for the piecewise linear transportation problem, Computing tight bounds via piecewise linear functions through the example of circle cutting problems, Piecewise linear bounding functions in univariate global optimization, Global optimization of non-convex piecewise linear regression splines, Global optimization for transport network expansion and signal setting, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Post-pruning in decision tree induction using multiple performance measures, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, Exact penalty and optimality condition for nonseparable continuous piecewise linear programming, An efficient approach for the S‐shaped penalty function, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Convex Relaxations for Gas Expansion Planning, An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem, Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, A polyhedral study of the semi-continuous knapsack problem, Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing, On linear programs with linear complementarity constraints, Locally ideal formulations for piecewise linear functions with indicator variables, Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, An algorithm for piece-wise indefinite quadratic programming problem, Nonconvex, lower semicontinuous piecewise linear optimization, Integer programming for urban design, A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization, The hill detouring method for minimizing hinging hyperplanes functions, Models and strategies for efficiently determining an optimal vertical alignment of roads, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Piecewise-linear approximations of multidimensional functions, Piecewise linear approximation of functions of two variables in MILP models, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation, Fast feasibility check of the multi-material vertical alignment problem in road design, 0-1 reformulations of the multicommodity capacitated network design problem, Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\), Mixed integer models for the stationary case of gas network optimization, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
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
