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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Other |
| Sprog: | engelsk |
| Udgivet: |
The Institute Of National Planning.
2018
|
| Fag: | |
| Online adgang: | http://repository.inp.edu.eg/xmlui/handle/123456789/3984 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
| _version_ | 1853147123015483392 |
|---|---|
| author | Bazaraa, Mokhtar S. Elshafei, Alwalid N. |
| author_facet | Bazaraa, Mokhtar S. Elshafei, Alwalid N. |
| author_sort | Bazaraa, Mokhtar S. |
| collection | DSpace |
| description | 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. |
| format | Other |
| id | oai:repository.inp.ed.eg:123456789-3984 |
| institution | My University |
| language | English |
| publishDate | 2018 |
| publisher | The Institute Of National Planning. |
| record_format | dspace |
| spelling | oai:repository.inp.ed.eg:123456789-39842019-02-08T19:15:16Z An exact Branch-and-Bound procedure for the quadratic assignment problem Bazaraa, Mokhtar S. Elshafei, Alwalid N. Trees Methodology Procedure 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. 2018-08-12T08:09:18Z 2018-08-12T08:09:18Z 1979-09 Other http://repository.inp.edu.eg/xmlui/handle/123456789/3984 en External Notes.;1256 application/pdf The Institute Of National Planning. |
| spellingShingle | Trees Methodology Procedure Bazaraa, Mokhtar S. Elshafei, Alwalid N. An exact Branch-and-Bound procedure for the quadratic assignment problem |
| title | An exact Branch-and-Bound procedure for the quadratic assignment problem |
| title_full | An exact Branch-and-Bound procedure for the quadratic assignment problem |
| title_fullStr | An exact Branch-and-Bound procedure for the quadratic assignment problem |
| title_full_unstemmed | An exact Branch-and-Bound procedure for the quadratic assignment problem |
| title_short | An exact Branch-and-Bound procedure for the quadratic assignment problem |
| title_sort | exact branch and bound procedure for the quadratic assignment problem |
| topic | Trees Methodology Procedure |
| url | http://repository.inp.edu.eg/xmlui/handle/123456789/3984 |
| work_keys_str_mv | AT bazaraamokhtars anexactbranchandboundprocedureforthequadraticassignmentproblem AT elshafeialwalidn anexactbranchandboundprocedureforthequadraticassignmentproblem AT bazaraamokhtars exactbranchandboundprocedureforthequadraticassignmentproblem AT elshafeialwalidn exactbranchandboundprocedureforthequadraticassignmentproblem |