3 resultados para 621.0

em SAPIENTIA - Universidade do Algarve - Portugal


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Tese dout., Engenharia electrónica e computação - Processamento de sinal, Universidade do Algarve, 2008

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.