Vector and matrix apportionment problems and separable convex integer optimization (Q2482690)
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 5267012
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vector and matrix apportionment problems and separable convex integer optimization |
scientific article; zbMATH DE number 5267012 |
Statements
Vector and matrix apportionment problems and separable convex integer optimization (English)
0 references
23 April 2008
0 references
Proportional and biproportional rounding
0 references
Totally unimodular matrix
0 references
Elementary vector
0 references
Graver basis
0 references
Convex programming duality
0 references
Alternating maximization procedure
0 references
0 references
0 references
0.7968225479125977
0 references
0.7799869775772095
0 references
0.7605797648429871
0 references
