Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

Previous article Next article Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemP. C. GilmoreP. C. Gilmorehttps://doi.org/10.1137/0110022PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout1 P. C. Gilmore, A solution to the module placement problem, IBM Research Report, RC-430, 1961, April 26 Google Scholar2 Tjalling C. Koopmans and , Martin Beckmann, Assignment problems and the location of economic activities, Econometrica, 25 (1957), 53–76 MR0089106 0098.12203 CrossrefISIGoogle Scholar3 H. W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Logist. Quart., 2 (1955), 83–97 MR0075510 0143.41905 CrossrefGoogle Scholar4 James Munkres, Algorithms for the assignment and transportation problems, J. Soc. Indust. Appl. Math., 5 (1957), 32–38 10.1137/0105003 MR0093429 0131.36604 LinkISIGoogle Scholar5 M. J. Rossman and , R. J. Twery, Combinatorial programming, Abstract Journal of ORSA (sixth annual meeting), Marwick, Mitchell and Co., Chicago, Also a mimeographed report from Peat Google Scholar6 Leon Steinberg, The backboard wiring problem: a placement algorithm, SIAM Rev., 3 (1961), 37–50 10.1137/1003003 MR0122657 0097.14703 LinkISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite ProgrammingHans Mittelmann and Jiming Peng2 December 2010 | SIAM Journal on Optimization, Vol. 20, No. 6AbstractPDF (251 KB)Solving Lift-and-Project Relaxations of Binary Integer ProgramsSamuel Burer and Dieter Vandenbussche28 July 2006 | SIAM Journal on Optimization, Vol. 16, No. 3AbstractPDF (228 KB)On the SQAP-PolytopeMichael Jünger and Volker Kaibel31 July 2006 | SIAM Journal on Optimization, Vol. 11, No. 2AbstractPDF (228 KB)Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment ProblemP. M. Pardalos, K. G. Ramakrishnan, M. G. C. Resende, and Y. Li31 July 2006 | SIAM Journal on Optimization, Vol. 7, No. 1AbstractPDF (274 KB)Can Parallel Branch and Bound without Communication Be Effective?Per S. Laursen13 July 2006 | SIAM Journal on Optimization, Vol. 4, No. 2AbstractPDF (1103 KB)A Review of the Placement and Quadratic Assignment ProblemsMaurice Hanan and Jerome M. Kurtzberg18 July 2006 | SIAM Review, Vol. 14, No. 2AbstractPDF (2163 KB)Statistical Properties of the Placement of a GraphW. E. Donath17 February 2012 | SIAM Journal on Applied Mathematics, Vol. 16, No. 2AbstractPDF (1397 KB) Volume 10, Issue 2| 1962Journal of the Society for Industrial and Applied Mathematics History Submitted:07 September 1961Published online:13 July 2006 InformationCopyright © 1962 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0110022Article page range:pp. 305-313ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics