A branch-and-cut method for 0-1 mixed convex programming (Q1968795): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINOS / rank | |||
Normal rank | |||
Revision as of 16:35, 28 February 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
