Algorithms for Packing Problems

• Grant number: 22/06728-5
• Support Opportunities: Scholarships in Brazil - Post-Doctoral
• Start date: July 01, 2022
• End date: February 28, 2023
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: Flávio Keidi Miyazawa
• Grantee: Santiago Valdés Ravelo
• Host 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.

Scientific publications

(The scientific publications listed on this page originate from the Web of Science or SciELO databases. Their authors have cited FAPESP grant or fellowship project numbers awarded to Principal Investigators or Fellowship Recipients, whether or not they are among the authors. This information is collected automatically and retrieved directly from those bibliometric databases.)

RAVELO, SANTIAGO VALDES; MIYAZAWA, FLAVIO K.. Packing Sets of Paths, Stars and Triangles: Tractability and Approximability. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2025, v. 15536, p. 11-pg., 2025-01-01. (15/11937-9, 22/06728-5, 22/05803-3)