This chapter examines the problem of packing tetris-like items, orthogonally, with the possibility of rotations, into a convex domain, in the presence of additional conditions. An MILP (Mixed Integer Linear Programming) and an MINLP (Mixed Integer Nonlinear Programming) models, previously studied by the author, are surveyed. An efficient formulation of the objective function, aimed at maximizing the loaded cargo, is pointed out for the MILP model. The MINLP one, addressed to the relevant feasibility sub-problem, has been conceived to improve approximate solutions, as an intermediate step of a heuristic process. A space-indexed model is further introduced and the problem of approximating polygons by means of tetris-like items investigated. In both cases an MILP formulation has been adopted. An overall heuristic approach is proposed to provide effective solutions in practice.
'A Modeling-based Approach for Non-standard Packing Problems' by Giorgio Fasano. In: Giorgio Fasano and János D. Pintér, Eds. Optimized Packings and Their Applications. Springer Optimization and Its Applications, pp 67-85, 2015
View A Modeling-based Approach for Non-standard Packing Problems