Solving quadratic assignment problems using convex quadratic programming relaxations
From MaRDI portal
Recommendations
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- Semidefinite programming relaxations for the quadratic assignment problem
- A convex form of the quadratic assignment problem
- scientific article; zbMATH DE number 5152705
- A Relaxed Assignment Algorithm For The Quadratic Assignement Problem
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- A contribution to quadratic assignment problems
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Solving the quadratic assignment problem
Cited in
(30)- A convex form of the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- A proximal DC approach for quadratic assignment problem
- An efficient continuation method for quadratic assignment problems
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- SDP relaxations for some combinatorial optimization problems
- A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- Exact solution of emerging quadratic assignment problems
- Convex quadratic and semidefinite programming relaxations in scheduling
- scientific article; zbMATH DE number 5152705 (Why is no real title available?)
- Subgraph Matching with Semidefinite Programming
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Second order cone programming relaxation for quadratic assignment problems
- An Exact Penalty Approach to the Quadratic Assignment Problem
- Quadratic assignment problem QAP with adaptable material handling devices
- scientific article; zbMATH DE number 1786176 (Why is no real title available?)
- scientific article; zbMATH DE number 761271 (Why is no real title available?)
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- The relative formulation of the quadratic programming problem in the aircraft assembly modeling
- A systematic encoding of the quadratic assignment problem onto Rydberg arrays
- Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Effective formulation reductions for the quadratic assignment problem
This page was built for publication: Solving quadratic assignment problems using convex quadratic programming relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2774598)
