The Graver complexity of integer programming (Q659795)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Graver complexity of integer programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Graver complexity of integer programming |
scientific article |
Statements
The Graver complexity of integer programming (English)
0 references
24 January 2012
0 references
Graver basis
0 references
Gröbner basis
0 references
Graver complexity
0 references
Markov complexity
0 references
contingencytable
0 references
transportation polytope
0 references
transportation problem
0 references
integer programming
0 references
computational complexity
0 references
0 references
0.8764001727104187
0 references
0.8000398874282837
0 references
0.7902260422706604
0 references
0.7617194056510925
0 references
0.7536556124687195
0 references
