A Portable Parallel Implementation of the lrs Vertex Enumeration Code

DOI10.1007/978-3-319-03780-6_36zbMath1406.68058OpenAlexW959774676MaRDI QIDQ2867140

Gary Roumanis, David Avis

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_36

zbMATH Keywords

parallel processingvertex enumerationreverse search

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Parallel algorithms in computer science (68W10)

Related Items

\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Toric Ext and Tor in polymake and Singular: The Two-Dimensional Case and Beyond

Uses Software

• cdd
• ZRAM
• lrs
• Boost
• Minksum

Cites Work

• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• The parallel search bench ZRAM and its applications
• Reverse search for enumeration
• Unnamed Item
• Unnamed Item