The following pages link to ZRAM (Q13782):
Displayed 39 items.
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- Matroid enumeration for incidence geometry (Q664549) (← links)
- Classification algorithms for codes and designs (Q819932) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- Optimal complexity reduction of polyhedral piecewise affine systems (Q958262) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- A solvable case of the quadratic assignment problem (Q1267182) (← links)
- Solving large-scale QAP problems in parallel with the serach library ZRAM (Q1268834) (← links)
- A parallel adaptive tabu search approach (Q1274621) (← links)
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel (Q1384091) (← links)
- Recent advances in the solution of quadratic assignment problems (Q1403282) (← links)
- Estimating the number of vertices of a polyhedron (Q1607035) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Parallel enumeration of triangulations (Q1658781) (← links)
- On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
- Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves (Q1736675) (← links)
- Solving large quadratic assignment problems on computational grids (Q1849534) (← links)
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
- Solving quadratic assignment problems using convex quadratic programming relaxations (Q2774598) (← links)
- A Portable Parallel Implementation of the lrs Vertex Enumeration Code (Q2867140) (← links)
- Early Estimates of the Size of Branch-and-Bound Trees (Q2892274) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory (Q3574125) (← links)
- (Q3840375) (← links)
- (Q4397722) (← links)
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem (Q4427381) (← links)
- Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations (Q4456206) (← links)
- (Q4471961) (← links)
- A mathematical model for zoning of protected natural areas (Q4670673) (← links)
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES (Q4682163) (← links)
- (Q4719331) (← links)
- Computational experience with the reverse search vertex enumeration algorithm (Q4946698) (← links)
- Hyperplane Arrangements in polymake (Q5041056) (← links)
- Output-sensitive cell enumeration in hyperplane arrangements (Q5054865) (← links)
- (Q5453776) (← links)
- The Distribution of Values in the Quadratic Assignment Problem (Q5704114) (← links)
- Enumerating the \(k\) best plane spanning trees (Q5931369) (← links)