PANDA: a software for polyhedral transformations. 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.
Keywords for this software
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Köppe, Matthias; Zhou, Yuan: New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem (2017)
- Lörwald, Stefan; Reinelt, Gerhard: PANDA: a software for polyhedral transformations (2015)