ZRAM

swMATH1038MaRDI QIDQ13782

No author found.

Described by source

• The parallel search bench ZRAM and its applications

Related Items (39)

Classification algorithms for codes and designs ⋮ An extreme point algorithm for a local minimum solution to the quadratic assignment problem ⋮ \texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Playing Games with Algorithms: Algorithmic Combinatorial Game Theory ⋮ Hyperplane Arrangements in polymake ⋮ Early Estimates of the Size of Branch-and-Bound Trees ⋮ Memory-efficient enumeration of constrained spanning trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Output-sensitive cell enumeration in hyperplane arrangements ⋮ A simple proof that the \((n^{2} - 1)\)-puzzle is hard ⋮ Unnamed Item ⋮ A survey for the quadratic assignment problem ⋮ A branch-and-cut algorithm for quadratic assignment problems based on linearizations ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ Parallel enumeration of triangulations ⋮ On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel ⋮ Unnamed Item ⋮ On parallel branch and bound frameworks for global optimization ⋮ Recent advances in the solution of quadratic assignment problems ⋮ Unnamed Item ⋮ Matroid enumeration for incidence geometry ⋮ The Distribution of Values in the Quadratic Assignment Problem ⋮ 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 ⋮ A mathematical model for zoning of protected natural areas ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ Solving quadratic assignment problems using convex quadratic programming relaxations ⋮ DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES ⋮ Computational experience with the reverse search vertex enumeration algorithm ⋮ Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem ⋮ A solvable case of the quadratic assignment problem ⋮ Solving large-scale QAP problems in parallel with the serach library ZRAM ⋮ Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations ⋮ A parallel adaptive tabu search approach ⋮ Solving large quadratic assignment problems on computational grids ⋮ A Portable Parallel Implementation of the lrs Vertex Enumeration Code ⋮ Estimating the number of vertices of a polyhedron

This page was built for software: ZRAM