Abstract
In this paper, we discuss a new algorithm for computing the integer hull \(P_I\) of a rational polyhedral set P, together with its implementation in Maple and in the C programming language. Our implementation focuses on the two-dimensional and three-dimensional cases. We show that our algorithm computes the integer hull efficiently and can deal with polyhedral sets with large numbers of integer points.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Assarf, B., Gawrilow, E., Herr, K., Joswig, M., Lorenz, B., Paffenholz, A., Rehn, T.: Computing convex hulls and counting integer points with polymake. Math. Program. Comput. 9(1), 1–38 (2017)
Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469–483 (1996)
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)
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)
Bruns, W., Ichim, B., Römer, T., Sieg, R., Söger, C.: Normaliz: algorithms for rational cones and affine monoids . J. Algebra 324 (2010)
Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 4(4), 305–337 (1973)
Cohen, H.: A Course in Computational Algebraic Number Theory, vol. 8. Springer-Verlag, Berlin (1993). https://doi.org/10.1007/978-3-662-02945-9
Cook, W.J., Hartmann, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27–37 (1992)
Fukuda, K.: cdd. c: C-implementation of the double description method for computing all vertices and extremal rays of a convex polyhedron given by a system of linear inequalities. Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland (1993)
Gomory, Ralph E..: Outline of an algorithm for integer solutions to linear programs and an algorithm for the mixed integer problem. In: Jünger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 77–103. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-540-68279-0_4
Hayes, A.C., Larman, D.G.: The vertices of the knapsack polytope. Discret. Appl. Math. 6(2), 135–138 (1983)
Jing, R.-J., Moreno Maza, M.: Computing the integer points of a polyhedron, I: algorithm. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2017. LNCS, vol. 10490, pp. 225–241. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66320-3_17
Jing, R., Moreno Maza, M.: The z_polyhedra library in maple. In: Gerhard, J., Kotsireas, I.S. (eds.) Maple in Mathematics Education and Research - Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15–17, 2019, Proceedings of the Communications in Computer and Information Science, vol. 1125, pp. 132–144. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-81698-8
Kaibel, V., Pfetsch, M.E.: Computing the face lattice of a polytope from its vertex-facet incidences. Comput. Geom. 23(3), 281–290 (2002)
Land, A., Doig, A.: An automatic method of solving discrete programming problems. Econometric 28, 497–520 (1960)
Loera, J.A.D., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symb. Comput. 38(4), 1273–1302 (2004)
Moreno Maza, M., Wang, L.: On the pseudo-periodicity of the integer hull of parametric convex polygons. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2021. LNCS, vol. 12865, pp. 252–271. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85165-1_15
Pick, G.: Geometrisches zur zahlenlehre. Sitzenber. Lotos (Prague) 19, 311–319 (1899)
Maple polyhedralsets package (2021), https://www.maplesoft.com/support/help/maple/view.aspx?path=PolyhedralSets
Schrijver, A. (Ed.): Theory of Linear and Integer Programming. Wiley, New York (1986)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1999)
Schrijver, A., et al.: On cutting planes. Combinatorics 79, 291–296 (1980)
Seghir, R., Loechner, V., Meister, B.: Integer affine transformations of parametric Z-polytopes and applications to loop nest optimization. ACM Trans. Archit. Code Optim. 9(2), 8:1–8:27 (2012)
Thomas, R.R.: Integer programming: Algebraic methods. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, 2nd edn., pp. 1624–1634. Springer, Boston (2009). https://doi.org/10.1007/978-0-387-74759-0
Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Counting integer points in parametric polytopes using Barvinok’s rational functions. Algorithmica 48(1), 37–66 (2007)
Veselov, S., Chirkov, A.Y.: Some estimates for the number of vertices of integer polyhedra. J. Appl. Ind. Math. 2(4), 591–604 (2008)
Yanagisawa, H.: A simple algorithm for lattice point counting in rational polygons (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Maza, M.M., Wang, L. (2022). Computing the Integer Hull of Convex Polyhedral Sets. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2022. Lecture Notes in Computer Science, vol 13366. Springer, Cham. https://doi.org/10.1007/978-3-031-14788-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-031-14788-3_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-14787-6
Online ISBN: 978-3-031-14788-3
eBook Packages: Computer ScienceComputer Science (R0)