Recent advances in the solution of quadratic assignment problems
Explore this paper's citation graph
Summary
This work describes the developments of a number of long-open QAPs, including those posed by Steinberg (1961), Nugent et al. (1968) and Krarup (1972), as well as recent work which is likely to result in the solution of even more difficult instances.
- Type
- article
- Published
- 2003-07-01
- Cited by
- 163
- References
- 63
- OpenAlex
- https://openalex.org/W34399546
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:31759500
Keywords
Mathematics, Quadratic equation, Quadratic assignment problem, Mathematical optimization, Exact solutions in general relativity
References
- Quadratic Assignment and Related Problems
- Combinatorial and Global Optimization
- QAPLIB – A Quadratic Assignment Problem Library
- Solving Large Quadratic Assignment Problems in Parallel
- Semidefinite Programming Relaxations for the Quadratic Assignment Problem
- TREE ELABORATION STRATEGIES IN BRANCH-AND- BOUND ALGORITHMS FOR SOLVING THE QUADRATIC ASSIGNMENT PROBLEM
- Optimized synthesis of self-testable finite state machines
- Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- An Experimental Comparison of Techniques for the Assignment of Facilities to Locations
- Robust taboo search for the quadratic assignment problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Location, Scheduling, Design and Integer Programming
- An improved annealing scheme for the QAP
- A greedy genetic algorithm for the quadratic assignment problem
- Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem
- The Backboard Wiring Problem: A Placement Algorithm
- Tabu Search Applied to the Quadratic Assignment Problem
- Exploiting orbits in symmetric ILP
- Quadratic Assignment Problems
Cited by
- A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem
- Recent advances and challenges in quadratic assignment and related problems
- Graph-theoretic studies of combinatorial optimization problems
- A DATA MINING APPROACH TO PERFORMANCE REFINEMENT OF A HEURISTIC ALGORITHM
- Probabilistic Analysis of Combinatorial Optimization Problems on Hypergraph Matchings
- DISTURBED SPARSE LINEAR EQUATIONS OVER THE 0-1 FINITE FIELD 1)
- Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
- Parallel implementation of interior-point methods for semidefinite optimization
- Semidefinite Programming Approaches for Structured Combinatorial Optimization Problems
- Solving the Quadratic Assignment Problem by a Hybrid Algorithm
- Global Optimization Methods for the Detection of Gravitational Waves
- Large (Brain) Graph Matching via Fast Approximate Quadratic Programming
- A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- Fast Approximate Quadratic Programming for Graph Matching
- Iterated fast local search algorithm for solving quadratic assignment problems
- A procedure for the evaluation and compensation of form errors by means of global isometric registration with subsequent local reoptimization
- Memetic search for the quadratic assignment problem
Related papers
- Tilt Stability for Quadratic Programs with One or Two Quadratic Inequality Constraints
- Sufficient global optimality conditions for some nonconvex quadratic program problems
- Sufficient Global Optimality Conditions for Some Nonconvex Quadratic Program Problems with Quadratic Constraints
- Sufficient Global Optimality Conditions for Some Nonconvex Quadratic Program Problems
- Solving quadratic assignment problems using convex quadratic programming relaxations
- New bounds for nonconvex quadratically constrained quadratic programming
- On the linearization of separable quadratic constraints in dual sequential convex programs
- A quadratic assignment formulation of the molecular conformation problem
- Solution Methods for Linear Factorized Quadratic Optimization and Quadratic Fractional Optimization Problem