On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569)
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 6477905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms |
scientific article; zbMATH DE number 6477905 |
Statements
On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (English)
0 references
2 September 2015
0 references
Lagrangian relaxation
0 references
lower bound
0 references
packing
0 references
covering
0 references
linear programming
0 references
0 references
0 references
0 references
0 references
0.89314926
0 references
0.8876259
0 references
0.88053906
0 references
0.8770383
0 references
0.8692563
0 references
0.8670875
0 references
0.8663538
0 references
