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...

Full description

Saved in:

Bibliographic Details
Main Authors:	Stefan Lörwald, Gerhard Reinelt
Format:	article
Language:	EN
Published:	Elsevier 2015
Subjects:	52Bxx 90C27 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Online Access:	https://doaj.org/article/9d2b64a6b7a045e99c4ce510181f1b1d
Tags:	Add Tag No Tags, Be the first to tag this record!

id	oai:doaj.org-article:9d2b64a6b7a045e99c4ce510181f1b1d
record_format	dspace
spelling	oai:doaj.org-article:9d2b64a6b7a045e99c4ce510181f1b1d2021-12-02T05:00:45ZPANDA: a software for polyhedral transformations2192-440610.1007/s13675-015-0040-0https://doaj.org/article/9d2b64a6b7a045e99c4ce510181f1b1d2015-11-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000484https://doaj.org/toc/2192-4406In 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.Stefan LörwaldGerhard ReineltElsevierarticle52Bxx90C27Applied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 3, Iss 4, Pp 297-308 (2015)
institution	DOAJ
collection	DOAJ
language	EN
topic	52Bxx 90C27 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	52Bxx 90C27 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Stefan Lörwald Gerhard Reinelt PANDA: a software for polyhedral transformations
description	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.
format	article
author	Stefan Lörwald Gerhard Reinelt
author_facet	Stefan Lörwald Gerhard Reinelt
author_sort	Stefan Lörwald
title	PANDA: a software for polyhedral transformations
title_short	PANDA: a software for polyhedral transformations
title_full	PANDA: a software for polyhedral transformations
title_fullStr	PANDA: a software for polyhedral transformations
title_full_unstemmed	PANDA: a software for polyhedral transformations
title_sort	panda: a software for polyhedral transformations
publisher	Elsevier
publishDate	2015
url	https://doaj.org/article/9d2b64a6b7a045e99c4ce510181f1b1d
work_keys_str_mv	AT stefanlorwald pandaasoftwareforpolyhedraltransformations AT gerhardreinelt pandaasoftwareforpolyhedraltransformations
_version_	1718400843709939712

PANDA: a software for polyhedral transformations

Similar Items