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.
No takes yet. Share an insight, caveat, or question.
Mokhtar S. Bazaraa (1975) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: