Computing the integer points of a polyhedron

Rui-Juan Jing, Marc Moreno Maza

Type: Article

Publication Date: 2019-05-30

Citations: 0

DOI: https://doi.org/10.1145/3338637.3338642

View Publication

Locations

ACM communications in computer algebra - View

Similar Works

Action	Title	Year	Authors
+	The polyhedra library in m <scp>aple</scp>	2018	Rui-Juan Jing Marc Moreno Maza
+	The Z_Polyhedra Library in Maple	2020	Rui-Juan Jing Marc Moreno Maza
+	Polyhedral Compilation and Counting	2016	Sven Verdoolaege
+	Algorithms for weighted counting over parametric polytopes: A survey and a practical comparison	2008	Sven Verdoolaege Maurice Bruynooghe
+	Computing the Integer Points of a Polyhedron, I: Algorithm	2017	Rui-Juan Jing Marc Moreno Maza
+	Integer Points in Polyhedra	2008	Alexander Barvinok
+	Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems	2007	Roberto Bagnara Patricia M. Hill Enea Zaffanella
+	Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems	2007	Roberto Bagnara Patricia M. Hill Enea Zaffanella
+	Faster Integer Points Counting in Parametric Polyhedra	2023	D. Gribanov D. S. Malyshev Pãnos M. Pardalos
+	Integer Partitions from the Polyhedral Point of View	2013	В. А. Шлык
+ PDF Chat	Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops	2014	Marius Bozga Radu Iosif Filip Konečný
+ PDF Chat	Integer affine transformations of parametric ℤ-polytopes and applications to loop nest optimization	2012	Rachid Seghir Vincent Loechner Benoît Meister
+	Octanary polyhedral branch and bound for integer programs	2022	James Bailey Todd Easton Fabio Vitor
+	Polynomial approximations in the polytope model: Bringing the power of quasi-polynomials to the masses	2008	Benoît Meister Sven Verdoolaege
+	ON SAMPLING INTEGER POINTS IN POLYHEDRA	2002	Igor Pak
+	Polyhedral Sets and Integer Rounding	2000	T NIESSEN J KIND
+	Many Order Types on Integer Grids of Polynomial Size	2020	Manfred Scheucher
+ PDF Chat	Memory optimization by counting points in integer transformations of parametric polytopes	2006	Rachid Seghir Vincent Loechner
+	Safety Problems are NP-complete for Flat Integer Programs with Difference Bounds Loops	2013	Marius Bozga Radu Iosif Filip Konečný
+	The Polyhedron-Hitting Problem	2014	Ventsislav Chonev Joël Ouaknine James Worrell

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (7)

Action	Title	Year	Authors
+	Fourier's Elimination: Which to Choose?	1993	Jean-Louis Imbert
+	Integer Points in Polyhedra	2008	Alexander Barvinok
+	A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed	1994	Alexander Barvinok
+ PDF Chat	On Polyhedral Projection and Parametric Programming	2008	Colin N. Jones Eric C. Kerrigan J.M. Maciejowski
+	Fourier–Motzkin Elimination Method	2008	Leonid Khachiyan
+	Computing parametric rational generating functions with a primal Barvinok algorithm	2007	Matthias Köppe Sven Verdoolaege
+ PDF Chat	Theory of Linear and Integer Programming.	1987	David K. Smith Alexander Schrijver