Marcos Nereu Arenales

• Abstract

  In this research project we intend to study: (i) cutting and packing problems, (ii) lot sizing and scheduling problems, (iii) the integration between cutting and/or packing problems in (i) with the lot sizing and/or scheduling problems in (ii). This continues the research developed in a previous thematic project whose financial support ended in March 2010, in which the main subject was th…

  Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings, AP.TEM

• Abstract

  This project is based on FAPESP-funded Thematic Projects which are lead by researchers of the Institute of Mathematical and Computer Science of the University of São Paulo and involve researchers of various other institutions in the state of São Paulo, Brazil. The themes of the research projects associated to the Thematic Projects are combinatorial optimization with application on cutting…

  Computational applications: optimization, fluid mechanics, dynamical systems, differential equations, singularities, AP.EMU

• Abstract

  The main subject of this thematic project is the study of Cutting and Packing Problems (CPP), which covers a large number of combinatorial optimization problems. These problems share the common feature of fitting items inside an object. This fitting, in its actual sense, can define the cutting of pieces in stock to produce the demanded items, as well as, the packing of boxes in a containe…

  Theory and practice of cutting and packing problems, AP.TEM

(Only some records are available in English at this moment)

• The multiperiod cutting stock problem, BP.IC
• Lot sizing problem in supply chain, BP.IC

• Abstract

  The current main methods of linear optimization are the simplex-type methods and the interior-point methods. The search for techniques that can result in efficient implementations is very active and make possible solving larger and more complex problems. The purpose of this project is to develop some techniques in order to improve the efficiency of those linear optimization methods. In si…

  Theoretical and computational issues for the efficient implementation of linear optimization methods, BP.DR

(Only some records are available in English at this moment)

• Abstract

  Branch-price-and-cut has proven to be a very powerful method for solving integer programming problems. It combines decomposition techniques with the generation of both columns and valid inequalities and relies on strong bounds to guide the search in the branch-and-bound tree. In this project, we investigate how the primal-dual interior point algorithm can be combined with the branch-price…

  Using the primal-dual interior point algorithm within the branch-price-and-cut method, BE.EP.DR