3 resultados para 10Me-C16:0
em SAPIENTIA - Universidade do Algarve - Portugal
Resumo:
Dissertação de mest., Tecnologia de Alimentos, Instituto Superior de Engenharia, Univ. do Algarve, 2012
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.
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.