A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
From MaRDI portal
Publication:3392024
DOI10.1287/opre.1060.0277zbMath1167.90589OpenAlexW1994716585MaRDI 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (31)
A parametric simplex algorithm for biobjective piecewise linear programming problems ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ A PLMF-based decomposition-coordination algorithm for fuzzy linear programming in industrial applications ⋮ A branch-cut-and-price algorithm for the piecewise linear transportation problem ⋮ Dual-mode production planning for manufacturing with emission constraints ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ Global optimization of non-convex piecewise linear regression splines ⋮ The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints ⋮ Scheduling for a processor sharing system with linear slowdown ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ Exact penalty and optimality condition for nonseparable continuous piecewise linear programming ⋮ An efficient approach for the S‐shaped penalty function ⋮ Structural Investigation of Piecewise Linearized Network Flow Problems ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ New classes of facets for complementarity knapsack problems ⋮ Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints ⋮ A polyhedral study of the semi-continuous knapsack problem ⋮ On linear programs with linear complementarity 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 ⋮ Models and strategies for efficiently determining an optimal vertical alignment of roads ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ A family of inequalities valid for the robust single machine scheduling polyhedron ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ Modeling and solving a multimodal transportation problem with flexible-time and scheduled services ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design
Uses Software
This page was built for publication: A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
