Abstract:
The two-dimensional location problem of rectangles on parallel lines is considered. For constructing a set of Pareto-optimal solutions, integer optimization and dynamic programming are applied. A computational experiment for the comparison of the approaches is carried out.