Computing convex hulls and counting integer points with \texttt{polymake}

DOI10.1007/s12532-016-0104-zzbMath1370.90009arXiv1408.4653OpenAlexW2254123846MaRDI QIDQ2398105

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

Publication date: 15 August 2017

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

Full work available at URL: https://arxiv.org/abs/1408.4653

zbMATH Keywords

convex hull computation lattice point enumeration polymake facets of integer hulls

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Greedy Causal Discovery Is Geometric, A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture, Polytope volume by descent in the face lattice and applications in social choice, Algorithms for Pfaffian Systems and Cohomology Intersection Numbers of Hypergeometric Integrals, Real Tropical Hyperfaces by Patchworking in polymake, \texttt{mplrs}: a scalable parallel vertex/facet enumeration code, Terminal toric Fano \(3\)-folds with numerical conditions, Normaliz 2013–2016, Smooth polytopes with negative Ehrhart coefficients, On the geometry of elementary flux modes, On the bond polytope, Combinatorial acyclicity models for potential‐based flows, A generalization of the space of complete quadrics, Ehrhart tensor polynomials, Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models, Packing, partitioning, and covering symresacks, Computing Galois groups of Ehrhart polynomials in OSCAR, Exact hierarchical reductions of dynamical models via linear transformations, On K3 fibred Calabi-Yau threefolds in weighted scrolls, Secure multi-party convex hull protocol based on quantum homomorphic encryption, Geometric approach to robust stability analysis of linear parameter-varying systems: computational trade-offs between the exact and the simplex convex hulls, Towards Landau-Ginzburg models for cominuscule spaces via the exceptional cominuscule family, Coupled Cluster Theory: Toward an Algebraic Geometry Formulation, Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls, PPLite: zero-overhead encoding of NNC polyhedra, Toric geometry of path signature varieties, Upper bounds for stabbing simplices by a line, Decomposable Pauli diagonal maps and tensor squares of qubit maps, A computational status update for exact rational mixed integer programming, On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods, A computational status update for exact rational mixed integer programming, Enumeration of the facets of cut polytopes over some highly symmetric graphs, Pruning Algorithms for Pretropisms of Newton Polytopes, polyDB: A Database for Polytopes and Related Objects, Moduli of tropical plane curves, Cluster partitions and fitness landscapes of the Drosophila fly microbiome, Two variations of graph test in double description method, Extended formulations for convex hulls of some bilinear functions, The regularized feasible directions method for nonconvex optimization, Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference, Frontiers of sphere recognition in practice, Parametric Shortest-Path Algorithms via Tropical Geometry, Computing the integer hull of convex polyhedral sets

Uses Software

Cites Work