A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization

DOI10.1287/opre.1060.0277zbMath1167.90589MaRDI QIDQ3392024

Nemhauser, George I., Ismael Regis jun. de Farias, Ahmet Burak Keha

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1060.0277

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Related Items

The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, On linear programs with linear complementarity constraints, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Nonconvex, lower semicontinuous piecewise linear optimization, The hill detouring method for minimizing hinging hyperplanes functions, 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, A family of inequalities valid for the robust single machine scheduling polyhedron, A polyhedral study of the semi-continuous knapsack 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

Uses Software

• MINTO