ZRAM

swMATH1038MaRDI QIDQ13782FDOQ13782

Author name not available (Why is that?)

Described by source

• The parallel search bench ZRAM and its applications

Cited In (39)

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

This page was built for software: ZRAM