Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2254123846 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.4653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are convex hull algorithms? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating facets for the cut polytope of a graph by triangular elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficients of Sylvester's Denumerant / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Threshold BDDs and the Optimal Variable Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of the double description method and the beneath-beyond algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental convex hull algorithms are not output sensitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of pyramid decomposition in Normaliz / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal convex hull algorithm in any fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for finding a general formula for the non-negative solutions of a system of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many aspects of counting lattice points in polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software for exact integration of polynomials over polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Sequence Alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flexible Object Hierarchies in Polymake / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertices of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beneath-and-Beyond revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programs and Convex Hulls Over Fields of Puiseux Fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and algebraic methods in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls, oracles, and homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all vertices of a polyhedron is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Barvinok Algorithm Based on Irrational Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numbers of faces of simplicial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized lower bound conjecture for polytopes and spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing parametric rational generating functions with a primal Barvinok algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a unimodularity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 05:55, 14 July 2024

scientific article
Language Label Description Also known as
English
Computing convex hulls and counting integer points with \texttt{polymake}
scientific article

    Statements

    Computing convex hulls and counting integer points with \texttt{polymake} (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 August 2017
    0 references
    This paper presents the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes, by making use of the polymake system that allows exploring and testing different algorithmical methods and implementations from the literature. These observations are summarized in ten ``rules of thumb''. After the introduction, the reader is familiarized with the polymake system (which provides a common interface for employing and comparing various algorithms and is available from polymake.org). Then, in the third section, various convex hull algorithms and their implementations are implemented and investigated in the polymake system, while Section 4 is devoted to enumerating lattice points in polytopes. Two appendices on the experimental setup and on the computational details close the paper.
    0 references
    convex hull computation
    0 references
    lattice point enumeration
    0 references
    facets of integer hulls
    0 references
    polymake
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers