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.
News published in Agência FAPESP Newsletter about the scholarship: