Pages that link to "Item:Q1947201"
From MaRDI portal
The following pages link to Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201):
Displaying 7 items.
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (Q3392024) (← links)
- Equivalence of Two Optimality Conditions for Polyhedral Functions (Q5054520) (← links)