On the complexity of the surrogate dual of 0–1 programming (Q3725870)
From MaRDI portal
!
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 3956814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the surrogate dual of 0–1 programming |
scientific article; zbMATH DE number 3956814 |
Statements
On the complexity of the surrogate dual of 0–1 programming (English)
0 references
1986
0 references
surrogate constraints
0 references
surrogate dual of a binary linear program
0 references
ellipsoid algorithm
0 references
Computational results
0 references
0.8496473431587219
0 references
0.7918489575386047
0 references
