EURO Journal on Computational Optimization

, Volume 3, Issue 4, pp 297–308

PANDA: a software for polyhedral transformations

Original Paper

DOI: 10.1007/s13675-015-0040-0

Cite this article as:
Lörwald, S. & Reinelt, G. EURO J Comput Optim (2015) 3: 297. doi:10.1007/s13675-015-0040-0

Abstract

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

Polyhedra Facet enumeration Vertex enumeration 

Mathematics Subject Classification

52Bxx 90C27 

Copyright information

© EURO - The Association of European Operational Research Societies 2015

Authors and Affiliations

  1. 1.Institut für InformatikUniversität HeidelbergHeidelbergGermany

Personalised recommendations