Advanced search
Start date
Betweenand

Theoretical and Pratical Approaches to Packing Problems

Grant number: 13/21744-8
Support type:Scholarships in Brazil - Post-Doctorate
Effective date (Start): March 01, 2014
Effective date (End): May 31, 2016
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal Investigator:Flávio Keidi Miyazawa
Grantee:Rafael Crivellari Saliba Schouery
Home Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil

Abstract

This is the research project to the postdoc of Rafael Crivellari Saliba Schouery, to be supervised by Flávio Keidi Miyazawa at the Instituto de Computação, UNICAMP, from 10/02/2014 to 09/02/2016. The objective is to achieve significant advances in problems of combinatorial optimization. For this, the candidate will work on packing problems from the practical and theoretical standing points, considering packing problems of multidimensional geometrical objects and variants such as online and selfish versions.The candidate has a good background on combinatorial optimization problem in practical and theoretical perspectives. The project's supervisor is one of the most experienced brazilians in the field of combinatorial optimization and, in particular, in packing problems, having the best currently known approximation factors for a variate of problems such as tridimensional packing in the general case with orthogonal rotations, tridimensional packing in containers with orthogonal rotations, dynamic packing of squares, unidimensional packing with divisions and with classes, parametric packing, strip packing with ordering, and also having the best results for the price of anarchy for the bidimensional packing game. The background of the candidate and the vast experience of the supervisor give us a great belief that the project will be concluded with success.

Scientific publications (8)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
BORGES, YULLE G. F.; SCHOUERY, RAFAEL C. S.; MIYAZAWA, FLAVIO K.; GRANELLI, FABRIZIO; DA FONSECA, NELSON L. S.; MELO, LUCAS P. Smart energy pricing for demand-side management in renewable energy smart grids. International Transactions in Operational Research, v. 27, n. 6 NOV 2019. Web of Science Citations: 0.
FERNANDES, CRISTINA G.; SCHOUERY, RAFAEL C. S. Approximation Algorithms for the Max-Buying Problem with Limited Supply. ALGORITHMICA, v. 80, n. 11, p. 2973-2992, NOV 2018. Web of Science Citations: 0.
TICONA-ZEGARRA, EDSON; SCHOUERY, RAFAEL C. S.; VILLAS, LEANDRO A.; MIYAZAWA, FLAVIO K. Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks. International Journal of Distributed Sensor Networks, v. 14, n. 5 MAY 11 2018. Web of Science Citations: 1.
MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; DE SOUZA, RENATA G. D. A PTAS for the Geometric Connected Facility Location Problem. THEORY OF COMPUTING SYSTEMS, v. 61, n. 3, p. 871-892, OCT 2017. Web of Science Citations: 0.
MELO, LUCAS P.; MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S. Approximation algorithms for k-level stochastic facility location problems. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 34, n. 1, p. 266-278, JUL 2017. Web of Science Citations: 1.
DE QUEIROZ, THIAGO ALVES; DEL BIANCO HOKAMA, PEDRO HENRIQUE; SALIBA SCHOUERY, RAFAEL CRIVELLARI; MIYAZAWA, FLAVIO KEIDI. Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches. COMPUTERS & INDUSTRIAL ENGINEERING, v. 105, p. 313-328, MAR 2017. Web of Science Citations: 5.
MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; SVIRIDENKO, MAXIM; WAKABAYASHI, YOSHIKO. Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. ALGORITHMICA, v. 76, n. 2, p. 536-568, OCT 2016. Web of Science Citations: 5.
HOKAMA, PEDRO; MIYAZAWA, FLAVIO K.; SCHOUERY, RAFAEL C. S. A bounded space algorithm for online circle packing. INFORMATION PROCESSING LETTERS, v. 116, n. 5, p. 337-342, MAY 2016. Web of Science Citations: 6.

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