A convex form of the quadratic assignment problem

DOI10.1016/0377-2217(93)90120-CzbMATH Open0769.90067OpenAlexW2001201947MaRDI QIDQ1804071FDOQ1804071

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

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 Keywords

quadratic assignmentsufficient optimality condition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The facility layout problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• An algorithm for the quadratic assignment problem using Benders' decomposition
• Quadratic assignment problems
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Contributions to the quadratic assignment problem
• A heuristic procedure for solving the quadratic assignment problem
• A modification of the Geoffrion/Dyer/Feinberg algorithm for finite multi- objective systems

Cited In (6)

• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• Solving quadratic assignment problems using convex quadratic programming relaxations
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• A quadratic assignment formulation of the molecular conformation problem
• Method for solving a convex integer programming problem
• A new bound for the quadratic assignment problem based on convex quadratic programming

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)