Implementing and testing branch-and-bound algorithm for the quadratic 0-1 problem on transputers
| Data(s) |
04/02/2013
04/02/2013
1997
28/01/2013
|
|---|---|
| Identificador |
Schutz, G.; Pires, F. M.; Ruano, A. E. Implementing and Testing Branch-and-Bound Algorithm for the Quadratic 0-1 Problem on Transputers, Trabalho apresentado em Euro XV Informs XXXIV, In Euro XV Informs XXXIV, Barcelona, 1997. AUT: GSC00606; MPI00450; ARU00698; |
| Idioma(s) |
eng |
| Direitos |
restrictedAccess |
| Palavras-Chave | #Quadratic 0-1 programming #Branch and bound algorithms #Parallel numerical algotithms |
| Tipo |
conferenceObject |
| Resumo |
Discrete optimization problems are very difficult to solve, even if the dimention is small. For most of them the problem of finding an ε-approximate solution is already NP-hard. The branch-and-bound algorithms are the most used algorithms for solving exactly this sort of problems. |
