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: | Stefan Lörwald, Gerhard Reinelt |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2015
|
Subjects: | |
Online Access: | https://doaj.org/article/9d2b64a6b7a045e99c4ce510181f1b1d |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A polyhedral approach to the generalized minimum labeling spanning tree problem
by: ThiagoGouveiada Silva, et al.
Published: (2019) -
Robust balanced optimization
by: AnnetteM.C. Ficker, et al.
Published: (2018) -
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
by: Jannis Kurtz
Published: (2018) -
Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
by: Jens Poppenborg, et al.
Published: (2016) -
Reflections on generating (disjunctive) cuts
by: Florent Cadoux, et al.
Published: (2013)