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...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Other |
| Lenguaje: | inglés |
| Publicado: |
The Institute Of National Planning.
2018
|
| Materias: | |
| Acceso en línea: | http://repository.inp.edu.eg/xmlui/handle/123456789/3984 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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. |
|---|