论文信息 - An exact branch‐and‐bound procedure for the quadratic‐assignment problem

An exact branch‐and‐bound procedure for the quadratic‐assignment problem

The quadratic-assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch-and-bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped fathoming to reduce the effort expended in searching the decision trees. Computational experience with the procedure is presented.

A. N. Elshafei | M. Bazaraa

[1] T. Koopmans,et al. Assignment Problems and the Location of Economic Activities , 1957 .

[2] P. Gilmore. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[3] E. Lawler. The Quadratic Assignment Problem , 1963 .

[4] A. H. Land,et al. A Problem of Assignment with Inter-Related Costs , 1963 .

[5] M. Breuer. The formulation of some allocation and connection problems as integer programs , 1966 .

[6] J. W. Gavett,et al. The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..

[7] J. H. Ahrens,et al. Suboptimal algorithms for the quadratic assignment problem , 1968 .

[8] Thomas E. Vollmann,et al. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[9] Andrew Whinston,et al. An Algorithm for the Quadratic Assignment Problem , 1970 .

[10] Alan Leslie Dorris. The utility of optimization techniques in the design of man-machine systems , 1971 .

[11] A. N. Elshafei,et al. Hospital Layout as a Quadratic Assignment Problem , 1977 .

[12] L. D. Hopkins,et al. Land-Use Plan Design—Quadratic Assignment and Central-Facility Models , 1977 .

[13] A. N. Elshafei,et al. Note--On the Use of Fictitious Bounds in Tree Search Algorithms , 1977 .