Mauro Maria Baldi

Learn More
— In this paper we introduce a new Packing problem, the Three-Dimensional Knapsack Problem with Balancing Constraints (3BKP), the extension of the Three-Dimensional Knapsack Problem (3KP) where additional constraints related to the packing center of mass are given. The 3BKP consists in orthogonally packing a subset of three-dimensional weighted items into a(More)
Porto, the institutional repository of the Politecnico di Torino, is provided by the University Library and the IT-Services. The aim is to enable open access to all the world. Please share with us how this access benefits you. Your story matters. Abstract: Tamping is an important part of railway maintenance. Well tamped ballast reduces track irregularities(More)
Packing problems are a class of optimization problems with: a set of " objects " , named items, to be loaded a set of containers or bins which will host the items an objective function to optimize (for instance, minimize the number of bins used) a set of constraints to satisfy (for instance, capacity constraints). The main families of packing problems are(More)
  • 1