We provide an introduction and state of the art overview of integrated layout design of
multicomponent systems. We review several packing optimization and overlap detection …

Improving Packing Algorithms for Server Consolidation Page 1 Improving Packing
Algorithms for Server Consolidation YASUHIRO AJIRO, ATSUHIRO TANAKA SYSTEM …

A new integrated layout optimization method is proposed here for the design of multi‐
component systems. By introducing movable components into the design domain, the …

In this paper, we propose a greedy heuristic for the 2D rectangular packing problem (2DRP)
that represents packings using a skyline; the use of this heuristic in a simple tabu search …

This paper presents a novel topology description model for topology optimization problems
with embedded movable holes, combining the ability of the level set model for accurate …

The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of
rectangles can be packed in a larger rectangle of fixed size. We propose an exact method …

Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

We consider two types of orthogonal, oriented, rectangular, two-dimensional packing
problems. The first is the strip packing problem, for which four new and improved level …

This paper considers the two-dimensional strip-packing problem (2SP) in which a set of
rectangular items have to be orthogonally packed, without overlapping, into a strip of a given …

In this paper, we examine the two-dimensional variable-sized bin packing problem
(2DVSBPP), where the task is to pack all given rectangles into bins of various sizes such that …