Lower Bounds on the Graver Complexity of M-Fold Matrices-Reference-Cited by-同舟云学术

Lower Bounds on the Graver Complexity of M-Fold Matrices

Published:2015-12-18 Issue:1 Volume:20 Page:73-85
ISSN:0218-0006
Container-title:Annals of Combinatorics
language:en
Short-container-title:Ann. Comb.

Author:

Finhold Elisabeth,Hemmecke Raymond

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00026-015-0297-2.pdf

Reference13 articles.

1. Berstein Y., Onn S.: The Graver complexity of integer programming. Ann. Combin. 13(3), 289–296 (2009)

2. Bogart T., Hemmecke R., Petrović S.: Universal Gröbner bases of colored partition identities. Exp. Math. 21(4), 395–401 (2012)

3. De Loera J.A., Hemmecke R., Köppe M.: Algebraic and Geometric Ideas in the Theory of Discrete Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2013)

4. De Loera, J.A., Hemmecke, R., Lee, J.: On augmentation algorithms for linear and integer-linear programming: from Edmonds-Karp to Bland and beyond. arXiv:1408.3518v2 (2014)

5. De Loera J.A., Hemmecke R., Onn S., Weismantel R.: N-fold integer programming. Discrete Optim. 5(2), 231–241 (2008)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asymptotic behavior of Markov complexity;Journal of Pure and Applied Algebra;2024-06

2. The Markov complexity of book graphs;Linear Algebra and its Applications;2023-03

3. Unboundedness of Markov complexity of monomial curves in An for n ≥ 4;Journal of Pure and Applied Algebra;2020-06

4. Evaluating and Tuning n -fold Integer Programming;ACM Journal of Experimental Algorithmics;2019-12-17