A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (Q3392024): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINTO / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.1060.0277 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994716585 / rank | |||
Normal rank | |||
Latest revision as of 19:55, 19 March 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
