The Graver complexity of integer programming (Q659795): Difference between revisions

@@ Property / OpenAlex ID @@
+W2078515884
@@ Property / OpenAlex ID: W2078515884 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1500
@@ Property / arXiv ID: 0709.1500 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
+Normal rank
@@ Property / cites work @@
+\(N\)-fold integer programming
@@ Property / cites work: \(N\)-fold integer programming / rank @@
+Normal rank
@@ Property / cites work @@
+All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
+Normal rank
@@ Property / cites work @@
+Markov bases of three-way tables are arbitrarily complicated
+Normal rank
@@ Property / cites work @@
+On the foundations of linear and integer linear programming I
+Normal rank
@@ Property / cites work @@
+On the Gröbner complexity of matrices
@@ Property / cites work: On the Gröbner complexity of matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Higher Lawrence configurations.
@@ Property / cites work: Higher Lawrence configurations. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4861423
@@ Property / cites work: Q4861423 / rank @@
+Normal rank