Solving quadratic assignment problems using convex quadratic programming relaxations

DOI10.1080/10556780108805828MaRDI QIDQ2774598zbMATH OpenOpenAlexFDO

Authors Nathan W. Brixius, Kurt M. Anstreicher

Publication date 26 February 2002

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780108805828

zbMATH Keywords

branch-and-bound algorithmquadratic assignment problemFrank-Wolfe algorithmconvex quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

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

(27)

• A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
• Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• An efficient continuation method for quadratic assignment problems
• 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
• scientific article; zbMATH DE number 761271 (Why is no real title available?)
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• The relative formulation of the quadratic programming problem in the aircraft assembly modeling
• Second order cone programming relaxation for quadratic assignment problems
• A proximal DC approach for quadratic assignment problem
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• SDP relaxations for some combinatorial optimization problems
• A convex form of the quadratic assignment problem
• Minimum energy configurations on a toric lattice as a quadratic assignment problem
• Convex quadratic and semidefinite programming relaxations in scheduling
• An experimental study of variable depth search algorithms for the quadratic assignment problem
• Exact solution of emerging quadratic assignment problems
• scientific article; zbMATH DE number 5152705 (Why is no real title available?)
• A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
• scientific article; zbMATH DE number 1786176 (Why is no real title available?)
• Subgraph Matching with Semidefinite Programming
• On improving convex quadratic programming relaxation for the quadratic assignment problem
• An Exact Penalty Approach to the Quadratic Assignment Problem
• Solving large quadratic assignment problems on computational grids
• Effective formulation reductions for the quadratic assignment problem
• Quadratic assignment problem QAP with adaptable material handling devices

Describes a project that uses

Uses Software

• HTCondor MW
• Meschach
• ZRAM
• QAPLIB

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)