

Author: Mukhacheva E. A. Mukhacheva A. S.
Publisher: MAIK Nauka/Interperiodica
ISSN: 0005-1179
Source: Automation and Remote Control, Vol.65, Iss.2, 2004-02, pp. : 248-257
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Orthogonal packing of rectangles in a semi-infinite strip and its representation by block structures, which reduces the problem to a special linear cutting problem, are studied. Schemes for constructing local optimum search methods and deterministic and probabilistic algorithms are designed. The results of a numerical experiment corroborating the effectiveness of new methods are given.
Related content








Contraint-Based Combinators for Local Search
By Hentenryck Pascal Michel Laurent Liu Liyuan
Constraints, Vol. 10, Iss. 4, 2005-10 ,pp. :


Dynamics of Local Search Trajectory in Traveling Salesman Problem
By Li Weiqi
Journal of Heuristics, Vol. 11, Iss. 5-6, 2005-12 ,pp. :