Implementing and testing branch-and-bound algorithm for the quadratic 0-1 problem on transputers

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.

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.

The perception of woman on the example of the Odyssey of Homer and its english translation by James Huddleston and portuguese translation by Frederico Lourenço

Dissertação de mestrado, Estudos Literários e Artísticos, Faculdade de Ciências Humanas e Sociais, Universidade do Algarve, 2015