Show simple item record

dc.contributor.authorBazaraa, Mokhtar S.
dc.contributor.authorElshafei, Alwalid N.
dc.date.accessioned2018-08-12T08:09:18Z
dc.date.available2018-08-12T08:09:18Z
dc.date.issued1979-09
dc.identifier.urihttp://repository.inp.edu.eg/xmlui/handle/123456789/3984
dc.description.abstractThe 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.isoenen_US
dc.publisherThe Institute Of National Planning.en_US
dc.relation.ispartofseriesExternal Notes.;1256
dc.subjectTreesen_US
dc.subjectMethodologyen_US
dc.subjectProcedureen_US
dc.titleAn exact Branch-and-Bound procedure for the quadratic assignment problemen_US
dc.typeOtheren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Who we are

Institute of National Planning (INP) was established by Law No. 231 of 1960 as a think-tank public institution with an independent legal personality to enhance the theory and practice of planning in Egypt through: research, training and educational activities. Also, INP aims at providing technical support to Ministry of Planning, as well as to all national ministers and institutions, through spreading a culture of planning in Egyptian society.

Contact Us

  • Salah Salem intersection with Al arashan Nasr City
  • 0222621151 - 0222634747
  • inplanning@idsc.net.eg
  • 0222629225 - 0222627840

    Copyright © 2018 All Rights Reserved - Powered by Egyptian Prime Vision