A convex form of the quadratic assignment problem

DOI10.1016/0377-2217(93)90120-CzbMath0769.90067OpenAlexW2001201947MaRDI QIDQ1804071

Douglas 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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic assignment problems
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A modification of the Geoffrion/Dyer/Feinberg algorithm for finite multi- objective systems
• The facility layout problem
• Contributions to the quadratic assignment problem
• A heuristic procedure for solving the quadratic assignment problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• A Review of the Placement and Quadratic Assignment Problems
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

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