A branch-and-bound-based heuristic for solving the quadratic assignment problem

DOI10.1002/NAV.3800300210MaRDI QIDQ3694983zbMATH OpenOpenAlexFDO

Authors ömer Kirca, Mokhtar S. Bazaraa

Publication date 1983

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800300210

zbMATH Keywords

branch-and-bound algorithmfacility locationquadratic assignment problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Recommendations

• A heuristic method for the quadratic assignment problem
• A new heuristic for the quadratic assignment problem
• An Improved Heuristic for the Quadratic Assignment Problem
• scientific article; zbMATH DE number 970341
• scientific article; zbMATH DE number 232498
• scientific article; zbMATH DE number 1996465
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
• A parallel branch and bound algorithm for the quadratic assignment problem

Cites work

• A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem

Cited in

(26)

• The facility layout problem
• A heuristic method for the multi-story layout problem
• Backtracking of jobs in one-dimensional machine location problems
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
• Network-based formulations of the quadratic assignment problem
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• Large-scale layout of facilities using a heuristic hybrid algorithm
• A genetic approach to the quadratic assignment problem
• A new exact algorithm for the solution of quadratic assignment problems
• A heuristic procedure for the single-row facility layout problem
• A heuristic method for the quadratic assignment problem
• Directional decomposition heuristic for a linear machine-cell location problem.
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
• A hybrid heuristic for the facilities layout problem
• A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems
• A trust branching path heuristic for permutation problems
• An Improved Heuristic for the Quadratic Assignment Problem
• scientific article; zbMATH DE number 2049005 (Why is no real title available?)
• scientific article; zbMATH DE number 2049010 (Why is no real title available?)
• scientific article; zbMATH DE number 232498 (Why is no real title available?)
• scientific article; zbMATH DE number 2196289 (Why is no real title available?)
• scientific article; zbMATH DE number 970341 (Why is no real title available?)
• Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple
• On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
• Efficient models for the facility layout problem
• A survey for the quadratic assignment problem

This page was built for publication: A branch-and-bound-based heuristic for solving the quadratic assignment problem

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