(1256) 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...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Other |
| Hizkuntza: | ingelesa |
| Argitaratua: |
The Institute Of National Planning.
2018
|
| Gaiak: | |
| Sarrera elektronikoa: | http://repository.inp.edu.eg/handle/123456789/3984 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
| _version_ | 1869359357901144064 |
|---|---|
| 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 | ir-123456789-3984 |
| institution | My University |
| language | English |
| publishDate | 2018 |
| publisher | The Institute Of National Planning. |
| record_format | dspace |
| spelling | ir-123456789-39842026-03-03T12:11:44Z (1256) 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/handle/123456789/3984 en External Notes.;1256 application/pdf The Institute Of National Planning. |
| spellingShingle | Trees Methodology Procedure Bazaraa, Mokhtar S. Elshafei, Alwalid N. (1256) An exact Branch-and-Bound procedure for the quadratic assignment problem إجراء دقيق للتفرع والتقييد لمسألة التخصيص التربيعي |
| title | (1256) An exact Branch-and-Bound procedure for the quadratic assignment problem
إجراء دقيق للتفرع والتقييد لمسألة التخصيص التربيعي |
| title_full | (1256) An exact Branch-and-Bound procedure for the quadratic assignment problem
إجراء دقيق للتفرع والتقييد لمسألة التخصيص التربيعي |
| title_fullStr | (1256) An exact Branch-and-Bound procedure for the quadratic assignment problem
إجراء دقيق للتفرع والتقييد لمسألة التخصيص التربيعي |
| title_full_unstemmed | (1256) An exact Branch-and-Bound procedure for the quadratic assignment problem
إجراء دقيق للتفرع والتقييد لمسألة التخصيص التربيعي |
| title_short | (1256) An exact Branch-and-Bound procedure for the quadratic assignment problem
إجراء دقيق للتفرع والتقييد لمسألة التخصيص التربيعي |
| title_sort | 1256 an exact branch and bound procedure for the quadratic assignment problem إجراء دقيق للتفرع والتقييد لمسألة التخصيص التربيعي |
| topic | Trees Methodology Procedure |
| url | http://repository.inp.edu.eg/handle/123456789/3984 |
| work_keys_str_mv | AT bazaraamokhtars 1256anexactbranchandboundprocedureforthequadraticassignmentproblemạjrạʾdqyqlltfrʿwạltqyydlmsạlẗạltkẖṣyṣạltrbyʿy AT elshafeialwalidn 1256anexactbranchandboundprocedureforthequadraticassignmentproblemạjrạʾdqyqlltfrʿwạltqyydlmsạlẗạltkẖṣyṣạltrbyʿy |