Solving quadratic assignment problems using convex quadratic programming relaxations
From MaRDI portal
Publication:2774598
DOI10.1080/10556780108805828zbMath0991.90107OpenAlexW2068671103MaRDI QIDQ2774598
Nathan W. Brixius, Kurt M. Anstreicher
Publication date: 26 February 2002
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780108805828
branch-and-bound algorithmquadratic assignment problemconvex quadratic programmingFrank-Wolfe algorithm
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (13)
A survey for the quadratic assignment problem ⋮ A branch-and-cut algorithm for quadratic assignment problems based on linearizations ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ A level-2 reformulation-linearization technique bound for the quadratic assignment problem ⋮ Minimum energy configurations on a toric lattice as a quadratic assignment problem ⋮ Exact solution of emerging quadratic assignment problems ⋮ On improving convex quadratic programming relaxation for the quadratic assignment problem ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ Subgraph Matching with Semidefinite Programming ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
Uses Software
This page was built for publication: Solving quadratic assignment problems using convex quadratic programming relaxations
