Author:
Moreno Maza Marc,Wang Linxiao
Publisher
Springer International Publishing
Reference21 articles.
1. Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19(4), 769–779 (1994). https://doi.org/10.1287/moor.19.4.769
2. Berndt, S., Jansen, K., Klein, K.: New bounds for the vertices of the integer hull. In: Le, H.V., King, V. (eds.) 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11–12, 2021, pp. 25–36. SIAM (2021). https://doi.org/10.1137/1.9781611976496.3
3. Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 4(4), 305–337 (1973). https://doi.org/10.1016/0012-365X(73)90167-2
4. Cook, W.J., Hartmann, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27–37 (1992). https://doi.org/10.1007/BF01191202
5. Ehrhart, E.: Polynômes arithmétiques et méthode des polyédres en combinatoire. International Series of Numerical Mathematics, Birkhäuser Verlag, Basel 35 (1977)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献