Computing convex hulls and counting integer points with polymake

DOI/10.1007/s12532-016-0104-zMaRDI QIDQ6824376FDO

Authors Benjamin Assarf, Ewgenij Gawrilow, Katrin Herr, Michael Joswig, Benjamin Lorenz, Andreas Paffenholz, Thomas Rehn

Publication date 23 May 2016

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://doi.org//10.1007/s12532-016-0104-z

Cited in

(24)

• Algorithm: Barvinok’s method for counting lattice points via short rational generating functions
• Software: polymake – framework for polytopes and polyhedra
• Problem: Integer hull of Fibonacci knapsack polytopes
• Algorithm: Beneath-and-Beyond incremental convex hull construction
• Software: LattE integrale – Barvinok-based lattice-point counting & integration
• Software: cddlib – double description and H↔V conversion
• Algorithm: Pyramid decomposition for cones (Normaliz)
• Problem: Compute Voronoi diagram via paraboloid lifting and dual convex hull
• Problem: Count or enumerate integer lattice points in a convex polytope
• Algorithm: Voronoi computation via paraboloid lifting and dual convex hull
• Software: lrslib – reverse search vertex enumeration
• Algorithm: Reverse search for vertex enumeration (Avis–Fukuda)
• Problem: Facets and statistics of non-symmetric cut polytopes
• Algorithm: Double Description method for vertex and extreme-ray enumeration
• Problem: Construct the convex hull of points (V-representation to H-representation) — primal convex hull
• Algorithm: Enumeration of 0/1 points with threshold BDDs (azove)
• Algorithm: Project-and-lift computation of Hilbert bases and integer hulls
• Problem: Compute vertices/extreme rays from halfspaces (H-representation to V-representation) — dual convex hull / vertex enumeration
• Software: azove – 0/1 vertex and facet enumeration via threshold BDDs
• Software: PORTA – Polyhedron Representation Transformation Algorithm
• Algorithm: Chernikova’s algorithm for converting systems of linear inequalities to generators
• Software: Normaliz – algorithms for affine monoids and cones (with pyramid decomposition)
• Problem: Compute the integer hull and its facet description of a rational polyhedron
• Software: 4ti2 – algorithms on linear spaces (Hilbert/Graver bases, etc.)

This page was built for publication: Computing convex hulls and counting integer points with polymake

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6824376)