A Relaxed Assignment Algorithm For The Quadratic Assignement Problem

DOI10.1080/03155986.1988.11732062MaRDI QIDQ3804446zbMATH OpenOpenAlexFDO

Authors Robert S. MacLeod, James MacGregor Smith

Publication date 1988

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

assignment problembranch-and-boundheuristic algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Recommendations

• Selected topics on assignment problems
• scientific article; zbMATH DE number 1302195
• An exact algorithm for the general quadratic assignment problem
• Multiple objective programming for the quadratic assignment problem
• An algorithm for the generalized quadratic assignment problem

Cited in

(7)

• An algorithm for quadratic assignment problems
• An exact algorithm for the minimum squared load assignment problem
• Solving quadratic assignment problems using convex quadratic programming relaxations
• A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
• scientific article; zbMATH DE number 5152705 (Why is no real title available?)
• On improving convex quadratic programming relaxation for the quadratic assignment problem
• An efficient algorithm for unequal area facilities layout planning with input and output points

This page was built for publication: A Relaxed Assignment Algorithm For The Quadratic Assignement Problem

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