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...
Enregistré dans:
Auteurs principaux: | Stefan Lörwald, Gerhard Reinelt |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2015
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/9d2b64a6b7a045e99c4ce510181f1b1d |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
A polyhedral approach to the generalized minimum labeling spanning tree problem
par: ThiagoGouveiada Silva, et autres
Publié: (2019) -
Robust balanced optimization
par: AnnetteM.C. Ficker, et autres
Publié: (2018) -
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
par: Jannis Kurtz
Publié: (2018) -
Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
par: Jens Poppenborg, et autres
Publié: (2016) -
Reflections on generating (disjunctive) cuts
par: Florent Cadoux, et autres
Publié: (2013)