The parallel search bench ZRAM and its applications
From MaRDI portal
Publication:1808187
DOI10.1023/A:1018972901171zbMath0937.90088OpenAlexW170032574MaRDI QIDQ1808187
Komei Fukuda, Adrian Brüngger, Ambros Marzetta, Jurg Nievergelt
Publication date: 2 December 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018972901171
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)
Related Items (14)
\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Hyperplane Arrangements in polymake ⋮ Memory-efficient enumeration of constrained spanning trees ⋮ Output-sensitive cell enumeration in hyperplane arrangements ⋮ A simple proof that the \((n^{2} - 1)\)-puzzle is hard ⋮ Parallel enumeration of triangulations ⋮ On parallel branch and bound frameworks for global optimization ⋮ Matroid enumeration for incidence geometry ⋮ Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves ⋮ Optimal complexity reduction of polyhedral piecewise affine systems ⋮ Enumerating the \(k\) best plane spanning trees ⋮ ZRAM ⋮ A Portable Parallel Implementation of the lrs Vertex Enumeration Code ⋮ Estimating the number of vertices of a polyhedron
Uses Software
This page was built for publication: The parallel search bench ZRAM and its applications
