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 adjac...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
25 June 2015
|
| In: |
EURO journal on computational optimization
Year: 2015, Volume: 3, Issue: 4, Pages: 297-308 |
| ISSN: | 2192-4414 |
| DOI: | 10.1007/s13675-015-0040-0 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/s13675-015-0040-0
|
| Author Notes: | Stefan Lörwald, Gerhard Reinelt |
| Summary: | 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. |
|---|---|
| Item Description: | Gesehen am 03.06.2020 |
| Physical Description: | Online Resource |
| ISSN: | 2192-4414 |
| DOI: | 10.1007/s13675-015-0040-0 |