A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers
Discrete optimization problems are very difficult to solve, even if the dimantion is small. For most of them the problem of finding an ε-approximate solution is already NP-hard.
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.1/2180 |
| País: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/2180 |