A branch-and-cut method for 0-1 mixed convex programming (Q1968795): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s101070050103 / 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S101070050103 / rank | |||
Normal rank | |||
Latest revision as of 15:50, 16 December 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
