Pages that link to "Item:Q3392024"
From MaRDI portal
The following pages link to A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (Q3392024):
Displayed 12 items.
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming (Q1934641) (← links)
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
- A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)