Approximating the maximum quadratic assignment problem
From MaRDI portal
Publication:1607075
DOI10.1016/S0020-0190(00)00151-4zbMath0996.90500OpenAlexW2023485317MaRDI QIDQ1607075
Refael Hassin, Esther M. Arkin, M. I. Sviridenko
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00151-4
Related Items (5)
A survey for the quadratic assignment problem ⋮ A parallel water flow algorithm with local search for solving the quadratic assignment problem ⋮ Maximizing Polynomials Subject to Assignment Constraints ⋮ Dynamic programming for the quadratic assignment problem on trees ⋮ Approximation algorithms for maximum linear arrangement
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for maximum packing of 3-edge paths
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- Approximation algorithms for minimum tree partition
- Approximation algorithms for min-sum \(p\)-clustering
- Approximation algorithms for maximum dispersion
- Better approximations for max TSP
- A class of bounded approximation algorithms for graph partitioning
- Obnoxious Facility Location on Graphs
- P-Complete Approximation Problems
- Approximating Capacitated Routing and Delivery Problems
- Heuristic and Special Case Algorithms for Dispersion Problems
- The Traveling Salesman Problem with Distances One and Two
- A General Approximation Technique for Constrained Forest Problems
- The dense \(k\)-subgraph problem
This page was built for publication: Approximating the maximum quadratic assignment problem
