Strengthening Gilmore's bound for the quadratic assignment problem

DOI10.1016/0377-2217(94)90033-7zbMath0810.90095OpenAlexW1967960044MaRDI QIDQ1333480

Douglas J. White

Publication date: 15 September 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90033-7

zbMATH Keywords

heuristicsboundsquadratic assignment

Mathematics Subject Classification ID

Quadratic programming (90C20) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (2)

A survey for the quadratic assignment problem ⋮ Location and layout planning. A survey

Cites Work

• Unnamed Item
• Quadratic assignment problems
• An exact algorithm for the general quadratic assignment problem
• A parallel branch and bound algorithm for the quadratic assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
• A parallel heuristic for quadratic assignment problems
• The Quadratic Assignment Problem
• The Decomposition Algorithm for Linear Programs
• An Improved Heuristic for the Quadratic Assignment Problem
• A Heuristic Approach to Quadratic Assignment Problem
• The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
• Numerical investigations on quadratic assignment problems
• State Constraints in Convex Control Problems of Bolza
• A Review of the Placement and Quadratic Assignment Problems
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: Strengthening Gilmore's bound for the quadratic assignment problem