PANDA: a software for polyhedral transformations | Zendy

Stefan Lörwald | Zendy; Gerhard Reinelt | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

PANDA: a software for polyhedral transformations

Author(s) -

Stefan Lörwald,

Gerhard Reinelt

Publication year - 2015

Publication title -

euro journal on computational optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.95

H-Index - 14

eISSN - 2192-4414

pISSN - 2192-4406

DOI - 10.1007/s13675-015-0040-0

Subject(s) - adjacency list , polyhedron , computer science , software , enumeration , vertex (graph theory) , usability , computation , decomposition , theoretical computer science , integer (computer science) , parallel computing , graph , combinatorics , algorithm , mathematics , programming language , operating system , ecology , biology

In this paper, we present the software Parallel AdjaceNcy Decomposition Algorithm (PANDA), an efficient implementation of the vertex and facet enumeration problem for polyhedra. The software is based on the double description method. Special features are the possibility to employ the so-called adjacency decomposition, the option of doing computations in exact integer arithmetic, the exploitation of symmetry information and the easy usability of parallel hardware. With computational experiments, we demonstrate the effectiveness of the software.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research