(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...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Other |
| Lingua: | inglese |
| Pubblicazione: |
The Institute Of National Planning.
2018
|
| Soggetti: | |
| Accesso online: | http://repository.inp.edu.eg/handle/123456789/3984 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Lascia un commento!