Algorithms, combinatorics and optimization

Algorithms are the most fundamental concept in Computer Science. His study refers to basic theories such as Computational Complexity and Computability. On the other hand, the algorithm design, along with all its paradigms – sequential, parallel, distributed, randomized, approximate, quantum algorithms, among others – allows the computer to solve problems in the most diverse fields of knowledge. In this project, we investigated the concept of the algorithm in all its dimensions, from the basic research in computational complexity and paradigms of algorithms projects to the applied research aiming at the development of algorithms in areas such as Bioinformatics, Geometry Computational, Cryptography, and Information Security.

As an essential tool for the development of algorithms, combinatorial mathematics and optimization are investigated. As far as combinatorial mathematics is concerned, the development of data structures that support the execution of efficient algorithms as well as the search for a better understanding of fundamental combinatorial problems is sought. In what concerns optimization, this project seeks the conception and application of problem-solving techniques are sought through linear, nonlinear, integer or mixed programming models (exact and heuristic methods), as well as bio-inspired as ant colonies, genetic algorithms, swarms of particles.

Faculty Involved

  • Laura Silva de Assis
  • Pedro Henrique Gonzalez
  • Raphael Carlos Santos Machado (Leader)

Comments are closed.