(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...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Other |
| Язык: | английский |
| Опубликовано: |
The Institute Of National Planning.
2018
|
| Предметы: | |
| Online-ссылка: | http://repository.inp.edu.eg/handle/123456789/3984 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|