One dimension models in the partitioning and placement problems (abstract only)

Abstract

The approach for the model partitioning and packaging on the base of the graph linear placement and assignment algorithms is considered. The properties of the constructive and iteration algorithms based on the optimal reduction tree method are described.