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...
Guardado en:
Autores principales: | Stefan Lörwald, Gerhard Reinelt |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2015
|
Materias: | |
Acceso en línea: | https://doaj.org/article/9d2b64a6b7a045e99c4ce510181f1b1d |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A polyhedral approach to the generalized minimum labeling spanning tree problem
por: ThiagoGouveiada Silva, et al.
Publicado: (2019) -
Robust balanced optimization
por: AnnetteM.C. Ficker, et al.
Publicado: (2018) -
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
por: Jannis Kurtz
Publicado: (2018) -
Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
por: Jens Poppenborg, et al.
Publicado: (2016) -
Reflections on generating (disjunctive) cuts
por: Florent Cadoux, et al.
Publicado: (2013)