Approximating the minimum quadratic assignment problems
From MaRDI portal
Recommendations
- Lower bounds for the quadratic assignment problem
- A contribution to quadratic assignment problems
- scientific article; zbMATH DE number 4143776
- A new form of the quadratic assignment problem and approximate solutions
- The quadratic assignment problem. Theory and algorithms
- On the maximum quadratic assignment problem
- On the maximum quadratic assignment problem
- Improved lower bounds for the quadratic assignment problem
- Lower bounds based on linear programming for the quadratic assignment problem
- An algorithm for quadratic assignment problems
Cited in
(12)- The generalized assignment problem with minimum quantities
- Quadratic programming and combinatorial minimum weight product problems
- On the maximum quadratic assignment problem
- Quadratic assignment problems on series-parallel digraphs
- Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
- A contribution to quadratic assignment problems
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Maximizing Polynomials Subject to Assignment Constraints
- On the maximum quadratic assignment problem
- Dynamic programming for the quadratic assignment problem on trees
- Minimum congestion mapping in a cloud
This page was built for publication: Approximating the minimum quadratic assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930294)