Advanced search
Start date
Betweenand

Algorithms for Packing Problems

Grant number: 22/06728-5
Support type:Scholarships in Brazil - Post-Doctorate
Effective date (Start): July 01, 2022
Effective date (End): February 28, 2023
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal researcher:Flávio Keidi Miyazawa
Grantee:Santiago Valdés Ravelo
Home Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
Associated research grant:15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points, AP.TEM

Abstract

In this project we are interested in investigating combinatorial optimization problems, especially packing problems. In packing problems, we have a number of items in a given dimension that must be packed into containers satisfying some constraints. The packing must be done by optimizing a given objective function. The packing problems that we consider have applications in several areas such as logistics, allocation of computer resources, among others. The objective of this project is to investigate these problems in theoretical and practical ways, with the development of algorithms for them, as well as, investigate their complexity classes.

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Please report errors in scientific publications list by writing to: cdi@fapesp.br.