An n‐step, 2‐variable search algorithm for the component placement problem

DOI10.1002/NAV.3800200409MaRDI QIDQ4401227zbMATH OpenOpenAlexFDO

Authors Charles H. Heider

Publication date 1973

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

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

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20)

Cited in

(7)

• The single-finger keyboard layout problem
• A distance assignment approach to the facility layout problem
• Extensions of a tabu search adaptation to the quadratic assignment problem
• Directional decomposition heuristic for a linear machine-cell location problem.
• A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems
• An improved tabu search heuristic for solving facility layout design problems
• A survey for the quadratic assignment problem

This page was built for publication: An n‐step, 2‐variable search algorithm for the component placement problem

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