A convex form of the quadratic assignment problem

DOI10.1016/0377-2217(93)90120-CMaRDI QIDQ1804071zbMATH OpenOpenAlexFDO

Authors D. J. White

Publication date 29 June 1993

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(93)90120-c

zbMATH Keywords

quadratic assignmentsufficient optimality condition

Mathematics Subject Classification ID

Boolean programming (90C09) Integer programming (90C10) Quadratic programming (90C20) Convex programming (90C25)

Review text

It is shown how the objective function of the quadratic assignment problem can be made convex and how the convexity might be useful in solving the original problem. This procedure also leads to an easily applicable sufficient optimality condition.

Recommendations

• Solving quadratic assignment problems using convex quadratic programming relaxations
• A contribution to quadratic assignment problems
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• A new form of the quadratic assignment problem and approximate solutions
• A new bound for the quadratic assignment problem based on convex quadratic programming
• General forms of the quadratic assignment problem
• The quadratic assignment problem. Theory and algorithms
• scientific article; zbMATH DE number 3982880
• scientific article; zbMATH DE number 4143776

Cites work

• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• A heuristic procedure for solving the quadratic assignment problem
• A modification of the Geoffrion/Dyer/Feinberg algorithm for finite multi- objective systems
• A Review of the Placement and Quadratic Assignment Problems
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• An algorithm for the quadratic assignment problem using Benders' decomposition
• Contributions to the quadratic assignment problem
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• scientific article; zbMATH DE number 3765539 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3197060 (Why is no real title available?)
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Quadratic assignment problems
• The facility layout problem

Cited in

(8)

• A quadratic assignment formulation of the molecular conformation problem
• Method for solving a convex integer programming problem
• Solving quadratic assignment problems using convex quadratic programming relaxations
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• Convex hull of the orthogonal similarity set with applications in quadratic assignment problems
• Piecewise convex formulations of binary and permutation problems
• A new bound for the quadratic assignment problem based on convex quadratic programming
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times

This page was built for publication: A convex form of the quadratic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804071)