| dc.contributor.author | Bazaraa, Mokhtar S. | |
| dc.contributor.author | Elshafei, Alwalid N. | |
| dc.date.accessioned | 2018-08-12T08:09:18Z | |
| dc.date.available | 2018-08-12T08:09:18Z | |
| dc.date.issued | 1979-09 | |
| dc.identifier.uri | http://repository.inp.edu.eg/xmlui/handle/123456789/3984 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | The Institute Of National Planning. | en_US |
| dc.relation.ispartofseries | External Notes.;1256 | |
| dc.subject | Trees | en_US |
| dc.subject | Methodology | en_US |
| dc.subject | Procedure | en_US |
| dc.title | An exact Branch-and-Bound procedure for the quadratic assignment problem | en_US |
| dc.type | Other | en_US |
