The Graver complexity of integer programming (Q659795): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(N\)-fold integer programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: All Linear and Integer Programs Are Slim 3‐Way Transportation Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Markov bases of three-way tables are arbitrarily complicated / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the foundations of linear and integer linear programming I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Gröbner complexity of matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Higher Lawrence configurations. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4861423 / rank | |||
Normal rank |
Latest revision as of 21:24, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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