A branch-and-cut method for 0-1 mixed convex programming (Q1968795): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINOS / 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.1007/s101070050103 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049505431 / rank | |||
Normal rank | |||
Revision as of 19:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut method for 0-1 mixed convex programming |
scientific article |
Statements
A branch-and-cut method for 0-1 mixed convex programming (English)
0 references
29 October 2000
0 references
mixed integer programming
0 references
convex programming
0 references
