Computerized Layout Design: A Branch and Bound Approach

1 September 1975

journal article
other
Published by Taylor & Francis in A I I E Transactions

Vol. 7 (4) , 432-438
https://doi.org/10.1080/05695557508975028

Abstract

This paper presents a computerized procedure for layout design. The layout problem is formulated as a quadratic set covering problem. A branch and bound method for optimizing the resulting problem is devised. As a result, optimal and suboptimal layouts can be provided to the layout engineer for consideration and modification.

Keywords

This publication has 7 references indexed in Scilit:

A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
Operations Research, 1975
An n‐step, 2‐variable search algorithm for the component placement problem
Naval Research Logistics Quarterly, 1973
Layout Planning by Computer Simulation
A I I E Transactions, 1972
A Review of the Placement and Quadratic Assignment Problems
SIAM Review, 1972
An Algorithm for the Quadratic Assignment Problem
Management Science, 1970
Branch-and-Bound Methods: A Survey
Operations Research, 1966
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
Journal of the Society for Industrial and Applied Mathematics, 1962