A branch-and-cut method for 0-1 mixed convex programming (Q1968795)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 1419751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut method for 0-1 mixed convex programming |
scientific article; zbMATH DE number 1419751 |
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
0.8602879047393799
0 references
0.8369442820549011
0 references
0.8369362950325012
0 references
0.8349953889846802
0 references
0.8314397931098938
0 references
