Presentation
ParGO is an organized research group, made up of researchers who work around related and complementary lines of research, capable of functioning as a generating and transforming source of knowledge for application in programs and projects of relevance to the scientific and technological development of the country. .
It is a member of the CNPq Research Group Directory.
Objectives
The general objective of the group is to generate knowledge around the central theme of automatic (or automated) problem solving. In this sense, some specific activities stand out, such as:
- Research techniques for the development and implementation of concurrent, parallel and distributed algorithms for efficient resolution of large problems, that is, problems that deal with large amounts of data, especially those of combinatorial optimization.
- Study theoretical combinatorial problems (such as graph coloring, task scheduling, resource allocation, among others, and their variations), aiming at obtaining discrete and continuous models, with applications in practical problems of telecommunications and execution management of processes.
- Research theory and algorithm development techniques for complex combinatorial optimization problems, producing exact, random, approximate and heuristic algorithms, using decomposition, partitioning and problem approximation techniques, among others.
Research Interests
The group works in an integrated manner in the three areas that define its name, developing research and training human resources in topics related to:
- Concurrent, Parallel, and Distributed Programming
- Mathematical Programming (notably linear and integer )
- Combinatorial Optimization
- Theory of Computation
- Probability Theory
- Graph Theory
- Heuristics
