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...
שמור ב:
| Main Authors: | , |
|---|---|
| פורמט: | Other |
| שפה: | אנגלית |
| יצא לאור: |
The Institute Of National Planning.
2018
|
| נושאים: | |
| גישה מקוונת: | http://repository.inp.edu.eg/xmlui/handle/123456789/3984 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|