Cited in
(52)- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- Recent advances in the solution of quadratic assignment problems
- Matroid enumeration for incidence geometry
- Early estimates of the size of branch-and-bound trees
- Computational experience with the reverse search vertex enumeration algorithm
- scientific article; zbMATH DE number 2079850 (Why is no real title available?)
- scientific article; zbMATH DE number 1173721 (Why is no real title available?)
- On parallel branch and bound frameworks for global optimization
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- Playing games with algorithms: algorithmic combinatorial game theory
- Solving large-scale QAP problems in parallel with the serach library ZRAM
- A parallel adaptive tabu search approach
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
- A survey of meta-heuristic solution methods for the quadratic assignment problem
- Output-sensitive cell enumeration in hyperplane arrangements
- A survey for the quadratic assignment problem
- cdd
- QAPLIB
- HTCondor MW
- GRASP_QAP
- lrs
- PermLib
- SymPol
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Estimating the number of vertices of a polyhedron
- HAS-QAP
- mplrs
- Minksum
- Bob++
- PPBB
- MPTOPCOM
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- A solvable case of the quadratic assignment problem
- The Distribution of Values in the Quadratic Assignment Problem
- Hyperplane arrangements in \texttt{polymake}
- Solving quadratic assignment problems using convex quadratic programming relaxations
- scientific article; zbMATH DE number 1383707 (Why is no real title available?)
- Enumerating the \(k\) best plane spanning trees
- Optimal complexity reduction of polyhedral piecewise affine systems
- A mathematical model for zoning of protected natural areas
- Solving large quadratic assignment problems on computational grids
- Effective formulation reductions for the quadratic assignment problem
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves
- scientific article; zbMATH DE number 1187168 (Why is no real title available?)
- Memory-efficient enumeration of constrained spanning trees
- Parallel enumeration of triangulations
- A portable parallel implementation of the \textit{lrs} vertex enumeration code
- Classification algorithms for codes and designs
This page was built for software: ZRAM
