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...
Main Authors: | Stefan Lörwald, Gerhard Reinelt |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2015-11-01
|
Series: | EURO Journal on Computational Optimization |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440621000484 |
Similar Items
-
A polyhedral approach to the generalized minimum labeling spanning tree problem
by: ThiagoGouveiada Silva, et al.
Published: (2019-03-01) -
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
by: Thomas Kleinert, et al.
Published: (2021-01-01) -
Robust balanced optimization
by: AnnetteM.C. Ficker, et al.
Published: (2018-09-01) -
Optimal capacitated ring trees
by: Alessandro Hill, et al.
Published: (2016-05-01) -
Cyclic flats and corners of the linking polynomial
by: Kayibi Koko K., et al.
Published: (2018-08-01)