On the complexity of the surrogate dual of 0–1 programming (Q3725870): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 14:29, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the surrogate dual of 0–1 programming |
scientific article |
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
