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...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Other |
| Idioma: | inglês |
| Publicado em: |
The Institute Of National Planning.
2018
|
| Assuntos: | |
| Acesso em linha: | http://repository.inp.edu.eg/xmlui/handle/123456789/3984 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|