A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (Q3392024): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINTO / rank | |||
Normal rank | |||
Revision as of 13:20, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization |
scientific article |
Statements
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (English)
0 references
13 August 2009
0 references
